Skip to main content
SpringerLink
Log in
Book cover

European Conference on Computer Algebra

EUROCAL 1983: Computer Algebra pp 214–224Cite as

Factorisation of sparse polynomials

  • Alsorithms 4 — Factorization
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 162))

Abstract

Sparse polynomials xn±1 are often treated specially by the factorisation programs of computer algebra systems. We look at this, and ask how far this can be generalised. The answer is that more can be done for general binomials than is usually done, and recourse to a general purpose factoriser can be limited to "small" problems, but that general trinomials and denser polynomials seem to be a lost cause. We are concerned largely with the factorisation of univariate polynomials over the integers, being the simplest case.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft,J.E. & Ullman,J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  2. Bogen,R.A. et al., MACSYMA Reference Manual (version 9), M.I.T Laboratory for Computer Science, 1977.

    Google Scholar 

  3. Bremner, A., On Reducibility of Trinomials. Glasgow Math. J., 22(1981), pp. 155–156. Zbl. 464.12001. MR 82i:10079.

    Google Scholar 

  4. Capelli, A., Sulla Riduttibilità delle equazioni algebriche. Nota secunda. Rend. Accad. Sc. Fis. Mat. Soc. Napoli, Ser. 3, 4(1898), pp. 84–90.

    Google Scholar 

  5. Caviness, B.F., More on Computing Roots of Integers. SIGSAM Bulletin 9(1975) 3, pp. 18–20, 29.

    Google Scholar 

  6. Davenport, H., Lewis, D.J. & Schinzel, A., Equations of the form f(x)=g(y). Quart. J. Math (Oxford) (2) 12(1961) pp. 102–104. H. Davenport, Collected Papers, Academic Press, 1977, Vol. IV, pp. 1711–1719.

    Google Scholar 

  7. Fried, M., The Field of Definition of Function Fields and a Problem in the Reducibility of Polynomials in Two Variables. Illinois J. Math. 17(1973) pp. 128–146.

    Google Scholar 

  8. Hearn,A.C., REDUCE-2 User's Manual. Report UCP-19, University of Utah, 1973.

    Google Scholar 

  9. Knuth,D.E., The Art of Computer Programming, vol. II, Seminumerical Algorithms (2nd. ed.). Addison-Wesley, 1981.

    Google Scholar 

  10. Lang,S., Algebraic Number Theory. Addison-Wesley,1970.

    Google Scholar 

  11. Lenstra,A.K., Lenstra,H.W.,Jr. & Lovász,L., Factoring Polynomials with Rational Coefficients. Preprint IW 195/82, Afdeling Informatica. Mathematisch Centrum, Amsterdam.

    Google Scholar 

  12. Ljunggren, W., On the Irreducibility of Certain Trinomials and Quadrinomials. Math. Scand 8(1960) pp. 65–70.

    Google Scholar 

  13. Mikusiński, J. & Schinzel, A., Sur la réductibilité de certains trinômes. Acta Arithmetica 9(1964) pp 91–95.

    Google Scholar 

  14. Moore, P.M.A. & Norman, A.C., Implementing a Polynomial Factorization and GCD Package. Proc. SYMSAC 81, ACM, New York, 1981, pp. 109–116.

    Google Scholar 

  15. Schinzel, A., Solution d'un problème de K. Zarankiewicz sur les suites de puissances consécutives de nombres irrationnels. Colloq. Math. 9(1962), pp. 291–296.

    Google Scholar 

  16. Schinzel, A., Some Unsolved Problems on Polynomials. Matematicka Biblioteka 25(1963) pp. 63–70.

    Google Scholar 

  17. Schinzel, A., A General Irreducibility Criterion. J. Indian Math. Soc. (N.S.) 37(1973) pp. 1–8.

    Google Scholar 

  18. Schinzel, A., Reducibility of lacunary polynomials III. Acta Arithmetica 34(1978) pp. 227–266.

    Google Scholar 

  19. Schinzel, A., Selected Topics on Polynomials. University of Michigan Press, Ann Arbor, Michigan, 1982.

    Google Scholar 

  20. Schinzel,A., Private Communication.

    Google Scholar 

  21. Schnorr,C.P., Refined Analysis and Improvement On Some Factoring Algorithms. Proc. 8th. Colloquium on Automata, Languages and Programming (Springer Lecture Notes in Computer Science 115, 1981), pp. 1–15. Zbl. 469.68043.

    Google Scholar 

  22. Tverberg, H., On the Irreducibility of the Trinomials xn±xm±1. Math. Scand. 8(1960) pp. 121–126.

    Google Scholar 

  23. van der Waerden, B.L., Modern Algebra, vol. I. Ungar, New York, 1949 (trans. from Moderne Algebra, 2nd. ed., Springer, 1937)

    Google Scholar 

  24. Vaughan, R.C., Bounds for the Coefficients of Cyclotomic Polynomials. Michigan Math. J. 21(1974), pp. 289–295.

    Google Scholar 

  25. Wang, P.S., An Improved Multivariable Polynomial Factorising Algorithm. Math. Comp. 32(1978) pp. 1215–1231. Zbl. 383.10035.

    Google Scholar 

  26. Zippel, R.E., Newton's Iteration and the Sparse Hensel Algorithm. Proc. SYMSAC 81, ACM, New York, 1981, pp. 68–72.

    Google Scholar 

Download references

Author information

Author notes

  1. J. H. Davenport

    Present address: Emmanuel College, Cambridge, England

Authors and Affiliations

  1. Equipe d'Analyse Numérique, Laboratoire I.M.A.G., B.P. 68, 38402, Saint Martin d'Hères, France

    J. H. Davenport

Authors
  1. J. H. Davenport
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. A. van Hulzen

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Davenport, J.H. (1983). Factorisation of sparse polynomials. In: van Hulzen, J.A. (eds) Computer Algebra. EUROCAL 1983. Lecture Notes in Computer Science, vol 162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12868-9_105

Download citation

  • DOI: https://doi.org/10.1007/3-540-12868-9_105

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12868-7

  • Online ISBN: 978-3-540-38756-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation