Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325475 | Journal of Symbolic Computation | 2010 | 16 Pages |
Abstract
Let f(X,Y)âZ[X,Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely, of f modulo some prime integer p. The same idea of choosing a p satisfying some prescribed properties together with LLL is used to provide a new strategy for absolute factorization of f(X,Y). We present our approach in the bivariate case but the techniques extend to the multivariate case. Maple computations show that it is efficient and promising as we are able to construct the algebraic extension containing one absolute factor of a polynomial of degree up to 400.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Cristina Bertone, Guillaume Chèze, André Galligo,