Skip to main content

Polynomials with Integer Coefficients

  • Chapter
Mathematics for Computer Algebra
  • 454 Accesses

Abstract

This chapter is the culmination of this book. Here we describe algorithms of factorization of polynomials with integer coefficients. These algorithms use many of the results demonstrated in the previous chapters.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Factoring polynomials with rational coefficients, Math. Ann., 261, 1982, p. 515–534.

    Google Scholar 

  2. Factoring Polynomials with Rational Coefficients, Math. Ann., 261, 1982, p. 515–534.

    Google Scholar 

  3. See, for example, J.W.S. Casseis.— An introduction to the geometry of numbers, Springer, Heidelberg, 1971 (Lem. 4, Ch. 1, and Th. 1, Ch. 2).

    Google Scholar 

  4. On the Complexity of Finding Short Vectors in Integer Lattices, EUROCAL’ 83, London, ed. by van Hulzen, Lecture Notes in Computer Science, N. 162, Springer, Heidelberg, 1983.

    Google Scholar 

  5. Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm, Proc. of 11th ICALP, Antwerpen, 1984, Lecture Notes in Computer Science, N. 172, Springer, Heidelberg, 1984.

    Google Scholar 

  6. A more efficient Algorithm for Lattice Basis Reduction, J. Algorithms, 9, 1988, p. 47–62.

    Google Scholar 

  7. This examples is due to H.P.F. Swinnerton-Dyer. See the article of E. Kaltofen, Factorization of Polynomials in Computer Algebra, ed. B. Buchberger, G. E. Collins, R. Loos, Springer, 1982, p. 95–113.

    Google Scholar 

  8. This result is due to W. Specht. — Zur Theorie der algebraischen Gleichungen, Jahresber. Deutsch. Math., 5, 1938, p. 142–145.

    Google Scholar 

  9. For a more detailed proof see, for example, Maxim Bôcher, Introduction to higher algebra, Maemillan, New York, 1907.

    MATH  Google Scholar 

  10. B.R. McDonald. — Linear Algebra over commutative rings; Marcel Dekker, New York, 1984.

    MATH  Google Scholar 

  11. G.B. Price. — Some identities in the theory of determinants; Amer. Math. Monthly, 54, 1947, p. 75–90.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Mignotte, M. (1992). Polynomials with Integer Coefficients. In: Mathematics for Computer Algebra. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9171-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-9171-5_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4613-9173-9

  • Online ISBN: 978-1-4613-9171-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics