Skip to main content
SpringerLink
Log in

Application of scratchpad to problems in special functions and combinatorics

  • Conference paper
  • First Online:
Book cover Trends in Computer Algebra

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

  • 198 Accesses

Abstract

In this brief survey, we have illustrated some of the uses of computer algebra. It might be objected that our work could well be carried out in almost any computer language; so why bother with SCRATCHPAD? The answer, of course, lies in the naturalness and simplicity of computer algebra approaches to these problems. Expressions like (2.2), (3.1) and (4.1) can be coded in SCRATCHPAD in one line exactly as they are written. They can then be studied with minimal thought about the computer and maximal concentration on what is happening. Often mathematical research consists of sifting low grade ore, and when such sifting requires ingenious programming skills it is likely not to be carried out.

Partially supported by National Science Foundation Grant DMS-8503324

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.E. Andrews, Further problems on partitions, Amer. Math. Monthly, 94(1987), 437–439.

    Google Scholar 

  2. G.E. Andrews and R.J. Baxter, Lattice gas generalization of the hard hexagon model: III q-trinomial coefficients, J. Stat. Phys. 47(1987), 297–330.

    Article  Google Scholar 

  3. G.E. Andrews and R.J. Baxter, SCRATCHPAD explorations for elliptic theta functions, Proceedings of 1986 Stanford Conference on Computers and Mathematics, (to appear).

    Google Scholar 

  4. W.N. Bailey, Generalized Hypergeometric Series, Cambridge Math. Tract No. 32, Cambridge University Press, London and New York, 1935. (Reprinted: Hafner, New York, 1964).

    Google Scholar 

  5. N.G. de Bruijn, Asymptotic Methods in Analysis, North-Holland, Amsterdam, 1961.

    Google Scholar 

  6. E. Hansen, A Table of Series and Products, Prentice-Hall, Englewood Cliffs, 1975.

    Google Scholar 

  7. D.M. Jackson, Counting semi-regular permutations which are products of a full cycle and an involution, Research Report CORR 86-19, University of Waterloo, 1986.

    Google Scholar 

  8. R. Pavelle, Dealing with problems without numeric solutions, MACSYMA Newsletter, 1(1984), 6–7.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The Pennsylvania State University, 16802, University Park, Pennsylvania

    George E. Andrews

Authors
  1. George E. Andrews
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rainer Janßen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andrews, G.E. (1988). Application of scratchpad to problems in special functions and combinatorics. In: Janßen, R. (eds) Trends in Computer Algebra. Lecture Notes in Computer Science, vol 296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18928-9_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-18928-9_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18928-2

  • Online ISBN: 978-3-540-38850-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation