math.NT — Number Theory
Contributed by Tomislav Pejkovic
For every n≥2 we construct irreducible integer polynomials of degree
n and arbitrarily large height H with two roots at distance
≪nH−(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)∈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→+∞. Among families of degree
n in X and degree three in T, the maximum of e(F) is
(2n−1)/3. It is (4n−3)/6 for families irreducible over Q(T),
and (2n−2)/3 for monic families of odd degree n≥3.
For arbitrary degree in T, we prove e(F)≤(3n−1)/4.
Two roots in different irreducible factors over C(T) have
separation exponent strictly less than 2n/3. If E(n) denotes the
supremum of e(F) over squarefree families of degree n in X,
then E(n)/n tends to supd≥2E(d)/d∈[2/3,3/4].
Primarily AI-generated textHuman understanding: some partsinteger polynomialsirreducible polynomialspolynomial familiesroot separation