Remote Access Bulletin of the American Mathematical Society

Bulletin of the American Mathematical Society

ISSN 1088-9485(online) ISSN 0273-0979(print)

Book Review

The AMS does not provide abstracts of book reviews. You may download the entire review from the links below.


Full text of review: PDF   This review is available free of charge.
Book Information:

Author: Richard P. Stanley
Title: Enumerative combinatorics, vol. I
Additional book information: Wadsworth and Brooks/Cole, Monterey, 1986, xi + 306 pp., $42.95. ISBN 0-534-06546-5.

References [Enhancements On Off] (What's this?)

  • 1. Richard A. Askey and Mourad E. H. Ismail, The Rogers 𝑞-ultraspherical polynomials, Approximation theory, III (Proc. Conf., Univ. Texas, Austin, Tex., 1980), Academic Press, New York-London, 1980, pp. 175–182. MR 602713
  • 2. Rodney J. Baxter, Exactly solved models in statistical mechanics, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], London, 1982. MR 690578
  • 3. E. A. Bender and J. R. Goldman, Enumerative uses of generating functions, Indiana Univ. Math. J. 20 (1971), 753-765. MR 270931
  • 4. I. M. Gessel, Generating functions and enumeration of sequences, thesis, M.I.T., 1977.
  • 5. I. P. Goulden and D. M. Jackson, Combinatorial enumeration, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1983. With a foreword by Gian-Carlo Rota; Wiley-Interscience Series in Discrete Mathematics. MR 702512
  • 6. M. Henle, Dissection of generating functions, Stud. Appl. Math. 51 (1972), 397-410. MR 351833
  • 7. André Joyal, Une théorie combinatoire des séries formelles, Adv. in Math. 42 (1981), no. 1, 1–82 (French, with English summary). MR 633783, https://doi.org/10.1016/0001-8708(81)90052-9
  • 8. D. E. Knuth, The art of computer programming, Vol. 3, Addison-Wesley, Reading, 1973. MR 378456
  • 9. Daniel H. Greene and Donald E. Knuth, Mathematics for the analysis of algorithms, Progress in Computer Science, vol. 1, Birkhäuser, Boston, Mass., 1981. MR 642197
  • 10. D. E. Littlewood, Theory of group characters, Oxford Univ. Press, London, 1940. MR 2127
  • 11. Percy Alexander MacMahon, Collected papers. Vol. I, MIT Press, Cambridge, Mass.-London, 1978. Combinatorics; Mathematicians of Our Time; Edited and with a preface by George E. Andrews; With an introduction by Gian-Carlo Rota. MR 514405
  • 12. Paul Walton Purdom Jr. and Cynthia A. Brown, The analysis of algorithms, Holt, Rinehart & Winston, New York, 1985. MR 1104882
  • 13. G.-C. Rota, On the foundations of combinatorial theory I. Theory of Möbius function, Z. Wahrsch. Verw. Gebiete 2 (1964), 340-368. MR 174487
  • 14. R. Stanley, Linear homogeneous diophantine equations and magic labelings of graphs, Duke Math. J. 40 (1973), 607-632. MR 317970
  • 15. G. Viennot, Problèmes combinatoires posés par la physique statistique, Séminaire Bourbaki, no. 626, 1983/84.

Review Information:

Reviewer: George E. Andrews
Journal: Bull. Amer. Math. Soc. 17 (1987), 360-365
DOI: https://doi.org/10.1090/S0273-0979-1987-15595-9
American Mathematical Society