Journal of Systems Science and Complexity

, Volume 31, Issue 6, pp 1633–1646

# A New Algorithm for Computing the Extended Hensel Construction of Multivariate Polynomials

Article

## Abstract

This paper presents a new algorithm for computing the extended Hensel construction (EHC) of multivariate polynomials in main variable x and sub-variables u1, u2, · · ·, um over a number field $$\mathbb{K}$$. This algorithm first constructs a set by using the resultant of two initial coprime factors w.r.t. x, and then obtains the Hensel factors by comparing the coefficients of xi on both sides of an equation. Since the Hensel factors are polynomials of the main variable with coefficients in fraction field $$\mathbb{K}$$(u1, u2, · · ·, um), the computation cost of handling rational functions can be high. Therefore, the authors use a method which multiplies resultant and removes the denominators of the rational functions. Unlike previously-developed algorithms that use interpolation functions or Gröbner basis, the algorithm relies little on polynomial division, and avoids multiplying by different factors when removing the denominators of Hensel factors. All algorithms are implemented using Magma, a computational algebra system and experiments indicate that our algorithm is more efficient.

## Keywords

Extended Hensel construction multivariate polynomial resultant sylvester matrix

## Preview

Unable to display preview. Download preview PDF.

## References

1. 
Inaba D, Factorization of multivariate polynomials by extended Hensel construction, ACM SIGSAM Bulletin, 2005, 39(1): 2–14.
2. 
Wang P and Rothschild L, Factoring multivariate polynomials over the integers, ACM SIGSAM Bulletin, 1973, 28: 21–29.
3. 
Sasaki T and Kako F, Solving multivariate algebraic equation by Hensel construction, Japan Journal of Industrial and Applied Mathematics, 1999, 16(2): 257–285.
4. 
Sanuki M, Inaba D, and Sasaki T, Computation of GCD of sparse multivariate polynomials by extended Hensel construction, Proceedings of the 17th Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Romania, 2015.
5. 
Musser D, Algorithms for polynomial factorization, Doctoral Dissertation, the University of Wisconsin, Madison, 1971.Google Scholar
6. 
Geddes K, Czapor S, and Labahn G, Algorithms for Computer Algebra, Springer US, 1992.
7. 
Zippel R, Probabilistic algorithms for sparse polynomials, Proceedings of the International Symposiumon Symbolic and Algebraic Computation, France, 1979.
8. 
Kleine J, Monagan M, and Wittkopf A, Algorithms for the non-monic case of the sparse modular GCD algorithm, Proceedings of the International Symposium on Symbolic and Algebraic Computation, Beijing, 2005.Google Scholar
9. 
Moses J and Yun D, The EZ GCD algorithm, Proceedings of the ACM Annual Conference, Atlanta, Georgia, USA, 1973.Google Scholar
10. 
Sasaki T and Inaba D, Enhancing the extended Hensel construction by using Gr¨obner bases, Proceedings of the 18th International Workshop on Computer Algebra in Scientific Computing, Romania, 2016.
11. 
Cox D, Little J, and O’Shea D, Ideals, Varieties, and Algorithms, Springer-Verlag, New York, 2007.
12. 
Sasaki T and Inaba D, Various enhancements for extended Hensel construction of sparse multivariate polynomials, Proceedings of the 18th Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Romania, 2016.
13. 
Sasaki T and Sasaki M, A unifled method for multivariate polynomial factorizations, Japan Journal of Industrial and Applied Mathematics, 1993, 10: 21–39.
14. 
Monagan M and Tuncer B, Using sparse interpolation in Hensel lifting, Proceedings of the 18th International Workshop on Computer Algebra in Scientific Computing, Romania, 2016.