Abstract
We give a new upper bound for the height of an irreducible factor of an integer polynomial. This paper also contains a new bound for the general case of polynomials with complex coefficients.
These bounds are very useful in algorithms to factorize polynomials with integer (or algebraic) coefficients.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Bombieri, J. D. Vaaler. — On Siegel's lemma, Invent. Math., vol. 73, 1983, p. 539–560.
L. Cerlienco, M. Mignotte, F. Piras. — Computing the measure of a polynomial, J. Symb. Comp., vol. 4, no 1, 1987, p. 21–34.
Ph. Glesser. — Majoration de la norme des facteurs d'un polynôme; Annales de la Faculté des Sci. Toulouse, to appear.
A. K. Lenstra, H. W. Lenstra Jr, L. Lovà sz. — Factoring polynomials with rational integer coefficients, Math. Ann., v. 261, 1982, p. 515–531.
M. Mignotte. — An inequality about factors of polynomials, Math. of Comp., v. 28, 1974, p. 1153–1157.
M. Mignotte. — An inequality about irreducible factors of integer polynomials, J. Number Th., v. 30, no 2, 1988, pp. 156–166.
M. Mignotte. — Sur la répartition des racines des polynômes, Journées de Théorie des Nombres, Caen, septembre 1980.
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glesser, P., Mignotte, M. (1991). An inequality about irreducible factors of integer polynomials (II). In: Sakata, S. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1990. Lecture Notes in Computer Science, vol 508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54195-0_56
Download citation
DOI: https://doi.org/10.1007/3-540-54195-0_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54195-0
Online ISBN: 978-3-540-47489-0
eBook Packages: Springer Book Archive