arXiv · 0911.5024
Modular Las Vegas Algorithms for Polynomial Absolute Factorization
Abstract
Let $f(X,Y) \in \ZZ[X,Y]$ be an irreducible polynomial over $\QQ$. 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 factorize some polynomials of degree up to 400.
Explore related subjects
Keep this discovery
Cristina Bertone, Guillaume Chèze, André Galligo. 2010-01-28. Modular Las Vegas Algorithms for Polynomial Absolute Factorization. https://arxiv.org/abs/0911.5024
Cite the original work for its findings. Save a collection to share your selection of sources.