Bounds for heights of integer polynomial factors

MaRDI QIDQ4942256zbMATH OpenFDO

Authors Laurenţiu Panaitopol, Doru Ştefănescu

Publication date 9 July 2000

zbMATH Keywords

factors of polynomialspolynomials

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Review text

This paper contains several upper bounds for the height of a factor of an univariate integer polynomial. The special case of polynomials with non-negative coefficients is studied in detail. There are classes of polynomials for which the new estimates are slightly better than the standard ones. The paper ends with several interesting examples. For the entire collection see [Zbl 0930.00019].

Recommendations

• Bounds on factors in \(\mathbb Z[x]\)
• scientific article; zbMATH DE number 2107531
• scientific article; zbMATH DE number 17844
• Bounds for the height of a factor of a polynomial in terms of Bombieri's norms. I: The largest factor
• scientific article; zbMATH DE number 681099

Cited in

(5)

• Bounds on factors in \(\mathbb Z[x]\)
• Single-factor coefficient bounds
• Quantitative Estimates for Polynomials in One or Several Variables
• Upper bounds on the heights of polynomials and rational fractions from their values
• Majoration de la norme des facteurs d'un polynôme : cas où toutes les racines du polynôme sont réelles

This page was built for publication: Bounds for heights of integer polynomial factors

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