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, Volume 2
Additional book information: Cambridge University Press, Cambridge, 1999, xii+581 pp., ISBN 0-521-56069-1, $74.95

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

  • 1. S. Abhyankar, Two notes on formal power series, Proc. Amer. Math. Soc. 7 (1956), 903-905. MR 18:277a
  • 2. D. André, Solution directe du problème résolu par M. Bertrand, C. R. Acad. Sci. Paris 105 (1887), 436-437
  • 3. F. Bergeron, G. Labelle, and P. Leroux, Combinatorial species and tree-like structures, Encyclopedia of Mathematics and its Applications, vol. 67, Cambridge University Press, Cambridge, 1998. Translated from the 1994 French original by Margaret Readdy; With a foreword by Gian-Carlo Rota. MR 1629341
  • 4. A. Cayley, A theorem on trees, Quart. J. Math. 23 (1889), 376-378.
  • 5.  C. Chevalley, Introduction to the Theory of Algebraic Functions of One Variable, Amer. Math. Soc., Providence, 1951. MR 13:64a
  • 6. 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
  • 7. Frank Harary and Edgar M. Palmer, Graphical enumeration, Academic Press, New York-London, 1973. MR 0357214
  • 8. I. G. Macdonald, Symmetric functions and Hall polynomials, 2nd ed., Oxford Mathematical Monographs, The Clarendon Press, Oxford University Press, New York, 1995. With contributions by A. Zelevinsky; Oxford Science Publications. MR 1354144
  • 9.  G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, un chemische Verbindungen, Acta Math. 68 (1937), 145-253.
  • 10. G. Pólya and R. C. Read, Combinatorial enumeration of groups, graphs, and chemical compounds, Springer-Verlag, New York, 1987. Pólya’s contribution translated from the German by Dorothee Aeppli. MR 884155
  • 11. H. Prüfer, Neuer Beweis eines Satzes über Permutationen, Archiv für Mathematik und Physik 27 (1918), 142-144.
  • 12. C. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math. 13 (1961), 179–191. MR 0121305, https://doi.org/10.4153/CJM-1961-015-3
  • 13. Richard P. Stanley, Enumerative combinatorics. Vol. I, The Wadsworth & Brooks/Cole Mathematics Series, Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, CA, 1986. With a foreword by Gian-Carlo Rota. MR 847717
  • 14. Doron Zeilberger, A proof of Julian West’s conjecture that the number of two-stack-sortable permutations of length 𝑛 is 2(3𝑛)!/((𝑛+1)!(2𝑛+1)!), Discrete Math. 102 (1992), no. 1, 85–93. MR 1168135, https://doi.org/10.1016/0012-365X(92)90351-F

Review Information:

Reviewer: Ira M. Gessel
Affiliation: Brandeis University
Email: gessel@brandeis.edu
Journal: Bull. Amer. Math. Soc. 39 (2002), 129-135
Published electronically: October 12, 2001
Review copyright: © Copyright 2001 American Mathematical Society