Bounds on factors in Z[x]
From MaRDI portal
Publication:1930188
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.
Recommendations
Cited in
(11)- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Single-factor coefficient bounds
- On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x]\)
- [[:Publication:2926272|On Hensel's roots and a factorization formula in \(\mathbb Zx\)]]
- Factorization in Z[x]
- scientific article; zbMATH DE number 1419238 (Why is no real title available?)
- Certifying irreducibility in \(\mathbb{Z}[x]\)
- Methodologies of Symbolic Computation
- On the height of powers of a polynomial with integer coefficients
- Title not available (Why is no real title available?)
This page was built for publication: Bounds on factors in \(\mathbb Z[x]\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1930188)