Root separation for reducible monic polynomials of odd degree
Abstract
We study root separation of reducible monic integer polynomials of odd degree. Let h(P) be the naive height, sep(P) the minimal distance between two distinct roots of an integer polynomial P(x) and sep(P)=h(P)-e(P). Let er*(d)=limsupdeg(P)=d, h(P)-> +infty e(P), where the limsup is taken over the reducible monic integer polynomials P(x) of degree d. We prove that er*(d) <= d-2. We also obtain a lower bound for er*(d) for d odd, which improves previously known lower bounds for er*(d) when d = 5, 7, 9.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.