Advertisement

Factoring Multivariate Polynomials with Many Factors and Huge Coefficients

  • Michael MonaganEmail author
  • Baris Tuncer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11077)

Abstract

The standard approach to factor a multivariate polynomial in \(\mathbb {Z}[x_{1},x_{2},\dots ,x_{n}]\) is to factor a univariate image in \(\mathbb {Z}[x_{1}]\) then recover the multivariate factors from their images using a process known as multivariate Hensel lifting. For the case when the factors are expected to be sparse, at CASC 2016, we introduced a new approach which uses sparse polynomial interpolation to solve the multivariate polynomial diophantine equations that arise inside Hensel lifting.

In this work we extend our previous work to the case when the number of factors to be computed is more than 2. Secondly, for the case where the integer coefficients of the factors are large we develop an efficient p-adic method. We will argue that the probabilistic sparse interpolation method introduced by us provides new options to speed up the factorization for these two cases. Finally we present some experimental data comparing our new methods with previous methods.

Keywords

Polynomial factorization Sparse polynomial interpolation Multivariate Hensel lifting Polynomial diophantine equations 

References

  1. 1.
    Cox, D., Little, J., O’Shea, D.: Ideals, Varieties and Algorithms, 3rd edn. Springer, New York (2007).  https://doi.org/10.1007/978-0-387-35651-8CrossRefzbMATHGoogle Scholar
  2. 2.
    Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer, Boston (1992)CrossRefGoogle Scholar
  3. 3.
    Erdős, P., Kac, M.: The Gaussian law of errors in the theory of additive number theoretic functions. Am. J. Math. 62, 738–742 (1940)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Gelfond, A.O.: Transcendental and Algebraic Numbers. GITTL, Moscow (1952). English translation by Leo F. Boron, Dover, New York (1960)zbMATHGoogle Scholar
  5. 5.
    Hardy, G.H., Ramanujan, S.: The normal number of prime factors of a number \(n\). Q. J. Math. 48, 76–92 (1917)zbMATHGoogle Scholar
  6. 6.
    Kaltofen, E.: Sparse hensel lifting. In: Caviness, B.F. (ed.) EUROCAL 1985. LNCS, vol. 204, pp. 4–17. Springer, Heidelberg (1985).  https://doi.org/10.1007/3-540-15984-3_230CrossRefGoogle Scholar
  7. 7.
    Lang, S.: Diophantine Geometry. Wiley, Hoboken (1962)zbMATHGoogle Scholar
  8. 8.
    Law, M.: Computing characteristic polynomials of matrices of structured polynomials, Masters thesis (2017)Google Scholar
  9. 9.
    Lee, M.M.: Factorization of multivariate polynomials. Ph.D. thesis (2013)Google Scholar
  10. 10.
    Monagan, M., Tuncer, B.: Some results on counting roots of polynomials and the Sylvester resultant. In: Proceedings of FPSAC 2016, pp. 887–898. DMTCS (2016)Google Scholar
  11. 11.
    Monagan, M., Tuncer, B.: Using sparse interpolation in hensel lifting. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2016. LNCS, vol. 9890, pp. 381–400. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-45641-6_25CrossRefzbMATHGoogle Scholar
  12. 12.
    Steel, A.: Private communicationGoogle Scholar
  13. 13.
    Wang, P.S.: An improved multivariate polynomial factoring algorithm. Math. Comput. 32, 1215–1231 (1978)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Wang, P.S., Rothschild, L.P.: Factoring multivariate polynomials over the integers. Math. Comput. 29, 935–950 (1975)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Yun, D.Y.Y.: The Hensel lemma in algebraic manipulation. Ph.D. thesis (1974)Google Scholar
  16. 16.
    Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216–226. Springer, Heidelberg (1979).  https://doi.org/10.1007/3-540-09519-5_73CrossRefGoogle Scholar
  17. 17.
    Zippel, R.E.: Newton’s iteration and the sparse Hensel algorithm. In: Proceedings of SYMSAC 1981, pp. 68–72. ACM (1981)Google Scholar
  18. 18.
    Zippel, R.E.: Interpolating polynomials from their values. J. Symb. Comput. 9(3), 375–403 (1990)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Zippel, R.E.: Effective Polynomial Computation. Kluwer, Boston (1993)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of MathematicsSimon Fraser UniversityBurnabyCanada

Personalised recommendations