{"id":"hexagon/2611.00692","pdf":"https://hexagonmath.org/pdf/2611.00692v1","url":"https://hexagonmath.org/abs/2611.00692v1","tags":["msc:11C08","msc:11J61","msc:11T55","Diophantine approximation","function fields of positive characteristic","polynomial height","root separation"],"score":0,"title":"Root separation for polynomials over $\\mathbb{F}_q[T]$","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["Tomislav Pejkovic"],"reviews":0,"subject":"math.NT","summary":"We study the minimum distance between distinct roots of a separable polynomial of degree $d\\ge2$ over $\\mathbb{F}_q[T]$, with respect to the absolute value $|T|=q$. For reducible polynomials of height $H$, the exponent $d-1$ in the lower bound $H^{-(d-1)}$ is best possible in every degree. In characteristic two we construct absolutely irreducible polynomials that attain this bound at every height $q^N$, $N\\ge1$. In odd characteristic $p$, the exponent $d-1$ is best possible for absolutely irreducible polynomials whenever $d-1=p^a m$ with $p\\nmid m$ and $m\\mid p^a-1$. The separation exponents…","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"}