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

Primarily AI-generated textHuman understanding: some partsmath.NT — Number Theory

Contributed by Tomislav Pejkovic ↗

Version 1 / Nov 20, 2026 / CC BY 4.0

Abstract

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.

Provenance statement

The research was carried out under human direction from the choice of topic and research questions to the selection of results for the paper. OpenAI’s ChatGPT 6.2 Astra developed the constructions and proofs and drafted the manuscript. Anthropic’s Claude Fable 5.2 reviewed the manuscript, checked examples, and suggested improvements to the proofs and to the comparison with known results. The human review did not include an independent check of every proof.

Tools used

OpenAI
ChatGPT
Anthropic
Claude Fable

References

  1. D. Badziahin, Distance between cubics and rationals, Results Math. 81 (2026), article 58. doi:10.1007/s00025-026-02616-5 (https://doi.org/10.1007/s00025-026-02616-5).DOI
  2. Y. Bugeaud, On simultaneous approximation in fields of power series, Bull. Math. Soc. Sci. Math. Roumanie 65(113) (2022), 191--202.
  3. Y. Bugeaud and A. Dujella, Root separation for reducible integer polynomials, Acta Arith. 162 (2014), 393--403. doi:10.4064/aa162-4-6 (https://doi.org/10.4064/aa162-4-6).DOI
  4. Y. Bugeaud and M. Mignotte, On the distance between roots of integer polynomials, Proc. Edinb. Math. Soc. 47 (2004), 553--556. doi:10.1017/S0013091503000257 (https://doi.org/10.1017/S0013091503000257).DOI
  5. Y. Bugeaud and M. Mignotte, Polynomial root separation, Int. J. Number Theory 6 (2010), 587--602. doi:10.1142/S1793042110003083 (https://doi.org/10.1142/S1793042110003083).DOI
  6. X. Faber, Finite pp-irregular subgroups of PGL2(k)\mathrm{PGL}_2(k), La Matematica 2 (2023), 479--522. doi:10.1007/s44007-023-00051-4 (https://doi.org/10.1007/s44007-023-00051-4).DOI
  7. A. Lasjaunias and B. de Mathan, Differential equations and Diophantine approximation in positive characteristic, Monatsh. Math. 128 (1999), 1--6. doi:10.1007/PL00010080 (https://doi.org/10.1007/PL00010080).DOI
  8. K. Mahler, On a theorem of Liouville in fields of positive characteristic, Canad. J. Math. 1 (1949), 397--400. doi:10.4153/CJM-1949-035-0 (https://doi.org/10.4153/CJM-1949-035-0).DOI
  9. K. Mahler, An inequality for the discriminant of a polynomial, Michigan Math. J. 11 (1964), 257--262. doi:10.1307/mmj/1028999140 (https://doi.org/10.1307/mmj/1028999140).DOI
  10. T. Ooto, Quadratic approximation in Fq((T−1))\mathbb F_q((T^{-1})), Osaka J. Math. 54 (2017), 129--156. doi:10.18910/61892 (https://doi.org/10.18910/61892).DOI
Show all 13 referencesShow fewer references
  1. C. F. Osgood, Effective bounds on the ``Diophantine approximation'' of algebraic functions over fields of arbitrary characteristic and applications to differential equations, Indag. Math. 37 (1975), 105--119. doi:10.1016/1385-7258(75)90023-2 (https://doi.org/10.1016/1385-7258(75)90023-2).DOI
  2. H. Stichtenoth, Algebraic Function Fields and Codes , 2nd ed., Graduate Texts in Mathematics, vol. 254, Springer, Berlin, 2009. doi:10.1007/978-3-540-76878-4 (https://doi.org/10.1007/978-3-540-76878-4).DOI
  3. J. F. Voloch, Diophantine approximation in characteristic pp, Monatsh. Math. 119 (1995), 321--325. doi:10.1007/BF01293591 (https://doi.org/10.1007/BF01293591).DOI

Version history

  1. v1 · 19 pagesSubmitted by Tomislav PejkovicInitial depositCurrentNov 20, 2026