{"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","summary":"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$,…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT","Claude Fable"],"discussed":0,"published":"2026-11-20","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}