Skip to main content
Log in

Optimal algorithm for algebraic factoring

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This paper presents an optimized method for factoring multivariate polynomials over algebraic extension fields defined by an irreducible ascending set. The basic idea is to convert multivariate polynomials to univariate polynomials and algebraic extension fields to algebraic number fields by suitable integer substitutions. Then factorize the univariate polynomials over the algebraic number fields. Finally, construct multivariate factors of the original polynomial by Hensel lemma and TRUEFACTOR test. Some examples with timing are included.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Kronecker L. Grundzuge einer arithmetischen theorie der algebraischen Groben.J.f.d.reine u. angew.Math., 1992, 1882: 1–22.

    Google Scholar 

  2. van der Waerden B L. Modern Algebra. Vol.1, New York, 1953.

  3. Trager B M. Algebraic factoring and rational function integration.SYMSAC, 1976, pp.219–226.

  4. Wang P S. Factoring multivariate polynomials over algebraic number fields.Math. Comp., 1976, 30: 324–336.

    Article  MATH  MathSciNet  Google Scholar 

  5. Weinberger P J, Rothschild L P. Factoring polynomials over algebraic number fields.ACM Trans. Math. Software, 1976, 2: 335–350.

    Article  MATH  MathSciNet  Google Scholar 

  6. Lenstra A K. Lattices and factorization of polynomials over algebraic number fields. InProc. EUROCAM’82, 1982, pp.32–39.

  7. Lenstra A K. Factoring multivariate polynomials over algebraic number fields.SIAM J. Comp., 1987, 16: 591–598.

    Article  MATH  MathSciNet  Google Scholar 

  8. Hu S, Wang D M. Fast factorization of polynomials over rational number field or its extension fields.Kexue Tongbao, 1986, 31: 150–156.

    MathSciNet  Google Scholar 

  9. Wang D M. A method for factorizing multivariate polynomials over successive algebraic extension fields. Preprint. RISC-LINZ Johannes Kepler University, Austria, 1992.

    Google Scholar 

  10. Wu W T. Some remarks on factorization and GCD of multivariate polynomials.MM Research Preprints, 1993, No.11: 1–15.

    Google Scholar 

  11. Wu W T. Basic principles of mechanical theorem proving in elementary geometries.J. Syst. Sci. Math. Sci., 1984, 4: 207–235.

    Google Scholar 

  12. Encarnacion M K. On a modular algorithm for computing GCDs of polynomials over algebraic number fields. InISSAC’94, pp. 58–65.

  13. Abbott J A. On the factorization of polynomials over algebraic fields. Ph.D. Thesis, School of Math. Scis., University of Bath, England, 1989.

    Google Scholar 

  14. Zhi Lihong. Polynomial factorization over algebraic fields and its applications. PH.D. Thesis, Institute of Systems Science, The Chinese Academy of Sciences, 1996.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhi Lihong.

Additional information

This paper is partially supported by the Climbing Project Foundation of China.

Zhi Lihong received her B.Sc. degree in pure mathematics in 1991 from Peking University, and her Ph.D. degree from Institute of Systems Science, The Chinese Academy of Sciences, in 1996. Her research interests include geomtric reasoning, computer algebra and analysis, and computer-aided geometry design.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhi, L. Optimal algorithm for algebraic factoring. J. of Comput. Sci. & Technol. 12, 1–9 (1997). https://doi.org/10.1007/BF02943139

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943139

Keywords

Navigation