Bounds on Factors in Z[x]
classification
🧮 math.NT
math.AC
keywords
boundsfactorscoefficientsexamplesseveralappearbetterbound
read the original abstract
We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We compare these bounds and show that none is universally better than the others. In the second part of the paper we give several concrete examples of factorizations where the factors have "unexpectedly" large coefficients. These examples help us understand why the bounds must be larger than you might expect, and greatly extend the collection published by Collins.
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.