Skip to main content

Polynomial Factorization in Maple 2019

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1125))

Abstract

Maple 2019 has a new multivariate polynomial factorization algorithm for factoring polynomials in \(\mathbb {Z}[x_1,x_2,...,x_n]\), that is, polynomials in n variables with integer coefficients. The new algorithm, which we call MTSHL, was developed by the authors at Simon Fraser University. The algorithm and its sub-algorithms have been published in a sequence of papers [3,4,5]. It was integrated into the Maple library in early 2018 by Baris Tuncer under a MITACS internship with Maplesoft. MTSHL is now the default factoring algorithm in Maple 2019.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer Academic Publishers, Boston (1992)

    Book  Google Scholar 

  2. 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_230

    Chapter  Google Scholar 

  3. 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_25

    Chapter  MATH  Google Scholar 

  4. Monagan, M., Tuncer, B.: Factoring multivariate polynomials with many factors and huge coefficients. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2018. LNCS, vol. 11077, pp. 319–334. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99639-4_22

    Chapter  Google Scholar 

  5. Monagan, M., Tuncer, B.: The complexity of sparse Hensel lifting and sparse polynomial factorization. Symb. Comput. 99, 189–230 (2019)

    Article  MathSciNet  Google Scholar 

  6. Wang, P.S., Rothschild, L.P.: Factoring multivariate polynomials over the integers. Math. Comput. 29(131), 935–950 (1975)

    Article  MathSciNet  Google Scholar 

  7. Wang, P.S.: An improved multivariate polynomial factoring algorithm. Math. Comput. 32, 1215–1231 (1978)

    Article  MathSciNet  Google Scholar 

  8. Zippel, R.E.: Newton’s iteration and the sparse Hensel algorithm. In: Proceedings SYMSAC 1981, pp. 68–72. ACM (1981)

    Google Scholar 

  9. Zippel, R.E.: Interpolating polynomials from their values. J. Symb. Comput. 9(3), 375–403 (1990)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael Monagan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Monagan, M., Tuncer, B. (2020). Polynomial Factorization in Maple 2019. In: Gerhard, J., Kotsireas, I. (eds) Maple in Mathematics Education and Research. MC 2019. Communications in Computer and Information Science, vol 1125. Springer, Cham. https://doi.org/10.1007/978-3-030-41258-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41258-6_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41257-9

  • Online ISBN: 978-3-030-41258-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics