Polynomial factorization over ℤ[X]
This paper gives a new method of factorization of a polynomial P over ℤ. The method is grounded on the fact, that any squarefree polynomial has a simple p-adic root. The algorithm starts from a simple root of P over ℤ/pℤ and from this root the algorithm computes the corresponding root of P over ℤ/pk ℤ, using Newton's method. So we obtain a linear factor of P.
Afterwards, as Lenstra in , we search for a polynomial Q which is a multiple of this linear factor and which has sufficiently small coefficients. If k is sufficiently large, then Q is a divisor of P over ℤ.
Unable to display preview. Download preview PDF.
- G.E. Collins, The Calculation of Multivariate Polynomial Resultants, J. Ass. Comp. Ma., Vol. 18, no 1, 1971, pp. 515–522.Google Scholar
- D.E. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1969.Google Scholar
- A.K. Lenstra, H.W. Lenstra, L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann. 261, 1982, pp. 515–534.Google Scholar
- J.D. Lipson, Newton's method: a great algebraic algorithm, Proc. of 1976 ACM Symposium on Symbolic and Algebraic Comp.Google Scholar
- M. Mignotte, An inequality about factors of polynomials, Math. Comp. 28, 1974, pp. 1153–1157.Google Scholar
- R.T. Moenck, Fast Computation of GCD's, Proc. of 1973 ACM Symp. on the Theory of Computing.Google Scholar
- P.S. Wang, L.P. Rothschild, Factoring Multivariate Polynomials over the integers, Math. Comp., Vol. 29, 1975, pp. 935–950.Google Scholar
- D.Y. Yun, Algebraic algorithms using p-adic constructions, Proc. of 1976 ACM Symposium on Symbolic and Algebraic Comp.Google Scholar