Submitted works

Advanced search

math.NT — Number Theory

Root separation for polynomials over Fq[T]\mathbb{F}_q[T]

Contributed by Tomislav Pejkovic

We study the minimum distance between distinct roots of a separable polynomial of degree d≥2d\ge2 over Fq[T]\mathbb{F}_q[T], with respect to the absolute value ∣T∣=q|T|=q. For reducible polynomials of height HH, the exponent d−1d-1 in the lower bound H−(d−1)H^{-(d-1)} is best possible in every degree. In characteristic two we construct absolutely irreducible polynomials that attain this bound at every height qNq^N, N≥1N\ge1. In odd characteristic pp, the exponent d−1d-1 is best possible for absolutely irreducible polynomials whenever d−1=pamd-1=p^a m with p∤mp\nmid m and m∣pa−1m\mid p^a-1. The separation exponents for irreducible and absolutely irreducible polynomials coincide for every qq and dd.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationfunction fields of positive characteristicpolynomial heightroot separation
Nov 20, 202619 pages
PDFView work

math.NT — Number Theory

Root separation in one-parameter families of integer polynomials

Contributed by Tomislav Pejkovic

For every n≥2n\ge2 we construct irreducible integer polynomials of degree nn and arbitrarily large height HH with two roots at distance ≪nH−(4n−3)/6\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)∈Z[T,X]F(T,X)\in\mathbb{Z}[T,X] of positive degree in TT, let e(F)e(F) denote the exponent for which the least distance between two roots of F(t,X)F(t,X) is H(F(t,X))−e(F)+o(1)H(F(t,X))^{-e(F)+o(1)} as t→+∞t\to+\infty. Among families of degree nn in XX and degree three in TT, the maximum of e(F)e(F) is (2n−1)/3(2n-1)/3. It is (4n−3)/6(4n-3)/6 for families irreducible over Q(T)\mathbb{Q}(T), and (2n−2)/3(2n-2)/3 for monic families of odd degree n≥3n\ge3. For arbitrary degree in TT, we prove e(F)≤(3n−1)/4e(F)\le(3n-1)/4. Two roots in different irreducible factors over C(T)\mathbb{C}(T) have separation exponent strictly less than 2n/32n/3. If E(n)E(n) denotes the supremum of e(F)e(F) over squarefree families of degree nn in XX, then E(n)/nE(n)/n tends to sup⁡d≥2E(d)/d∈[2/3,3/4]\sup_{d\ge2}E(d)/d\in[2/3,3/4].

Primarily AI-generated textHuman understanding: some partsinteger polynomialsirreducible polynomialspolynomial familiesroot separation
Nov 20, 202618 pages
PDFView work