Root separation for reducible monic polynomials of odd degree
classification
🧮 math.NT
keywords
degreeintegermonicpolynomialsreduciblelimsuplowerroot
read the original 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 e_r*(d)=limsup_{deg(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 e_r*(d) <= d-2. We also obtain a lower bound for e_r*(d) for d odd, which improves previously known lower bounds for e_r*(d) when d = 5, 7, 9.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.