Skip to main content
Log in

An algorithmic approach to discovering and provingq-series identities

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

An algorithmic method of producingq-series identities from any given power series is discassed. This recursive technique is then used to give new proofs of several classicalq-identities of Gauss and Rogers.

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. G. E. Andrews,The Theory of Partitions, Addison-Wesley, Reading, MA, 1976. (Reissued: Cambridge University Press, Cambridge, 1998).

    MATH  Google Scholar 

  2. G. E. Andrews,Combinatorics and Ramanujan’s “Lost” Notebook, London Mathematical Society Lecture Note Series, No. 103, Cambridge University Press, London, 1985, pp. 1–23.

    Google Scholar 

  3. G. E. Andrews,q-Series: Their Development and Application in Analysis, Number Theory, combinatorics, Physics and Computer Algebra, CBMS Regional Conference Series in Mathematica, no. 66, American Mathematical Society, Providence, RI, 1986.

    Google Scholar 

  4. G. E. Andrews, A. Knopfmacher, and J. Knopfmacher, Engel expansions and the Rogers-Ramanujan identities,J. Number Theory,80 (2000), 273–290.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. J. Grabner and A. Knopfmacher, Metric properties of Engel series expansions of Laurent series,Math. Slovaca,48 (1998), 233–243.

    MATH  MathSciNet  Google Scholar 

  6. A. Knopfmacher and J. Knopfmacher, Inverse polynomial expansions of Laurent series,Constr. Approx.,4 (1988), 379–389.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Knopfmacher and J. Knopfmacher, Inverse polynomial expansions of Laurent series, II,J. Comput. Appl. Math.,28 (1989), 249–257.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Paule Short and easy computer proofs of the Rogers-Ramanujan identities and of identities of similar type,Electron. J. Combin. 1 (1994), R10, 1–9.

  9. P. Paule and A. Riese, A Mathematicaq-analogue of Zeilberger’s algorithm based on an algebraically motivated approach toq-hypergeometric telescoping, pp. 179–210 in:Fields Institute Communications, Vol. 14, American Mathematical Society, Providence, RI, 1997. (Proceedings of the Workshop on Special Functions,q-Series and Related Topics, organized by the Fields Institute for Research in Mathematical Sciences at University College, 12–23 June 1995, Toronto, Ontario; Editors: M. Ismail, D. R. Masson, and M. Rahman.)

    Google Scholar 

  10. M. Petkovsek, H. Wilf, and D. Zeilberger,A=B A. K. Peters, Wellesley, MA, 1996.

    MATH  Google Scholar 

  11. L. J. Slater, Further identities of the Rogers-Ramanujan type,Proc. London Math. Soc. Ser. 2,54 (1952), 147–167.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. Zeilberger,q EKHAD, available at http://www.math.temple.edu/zeilberg

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by H. Prodinger and W. Szpankowski.

Dedicated to the memory of John Knopfmacher, 1937–1999, the inventor of the Engel expansions for q-series.

The first author was partially supported by National Science Foundation Grant DMS-9206993 and by The Centre for Applicable Analysis and Number Theory of the University of the Witwatersrand. He wishes to express his gratitude to the second author who provided the hospitality and support which made his participation possible This paper was presented at the fourth International Conference on Average-Case Analysis of Algorithms, Princeton, NJ, by the second author.

Online publication September 6, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andrews, G.E., Knopfmacher, A. An algorithmic approach to discovering and provingq-series identities. Algorithmica 29, 34–43 (2001). https://doi.org/10.1007/BF02679612

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key Words

Navigation