Root separation for reducible monic polynomials of odd degree

DOI10.21857/MNLQGCJ04YMaRDI QIDQ4604266zbMATH OpenOpenAlexFDO

Authors Andrej Dujella, Tomislav Pejković

Publication date 23 February 2018

Published in Rad Hrvatske akademije znanosti i umjetnosti Matematičke znanosti (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.02120, http://hrcak.srce.hr/file/274956

zbMATH Keywords

integer polynomialsroot separation

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Recurrences (11B37) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

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.

Recommendations

• Root separation for reducible integer polynomials
• Root separation for reducible monic quartics
• Polynomial root separation
• Root separation for polynomials with reducible derivative
• Polynomial minimum root separation

Cited in

(5)

• Root separation for polynomials with reducible derivative
• Root separation for reducible integer polynomials
• Root separation for irreducible integer polynomials
• Root separation for reducible monic quartics
• Polynomial root separation in terms of the Remak height

This page was built for publication: Root separation for reducible monic polynomials of odd degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604266)