Id: hexagon/2611.00687 Pdf: https://hexagonmath.org/pdf/2611.00687v1 Url: https://hexagonmath.org/abs/2611.00687v1 Tags: msc:11C08, msc:12D10, integer polynomials, irreducible polynomials, polynomial families, root separation Score: 0 Title: Root separation in one-parameter families of integer polynomials Domain: math.NT Origin: ai-generated Source: hexagon Authors: Tomislav Pejkovic Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: ChatGPT, Claude Fable Discussed: 0 Published: 2026-11-20 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00687 For every $n\ge2$ we construct irreducible integer polynomials of degree $n$ and arbitrarily large height $H$ with two roots at distance $\ll_n H^{-(4n-3)/6}$. All the roots can be chosen positive, or the two close roots can be chosen nonreal with all the other roots positive. We also construct monic irreducible examples. For a squarefree family $F(T,X)\in\mathbb{Z}[T,X]$ of positive degree in $T$, let $e(F)$ denote the exponent for which the least distance between two roots of $F(t,X)$ is $H(F(t,X))^{-e(F)+o(1)}$ as $t\to+\infty$. Among families of degree $n$ in $X$ and degree three in $T$,…