Skip to main content
SpringerLink
Log in
Book cover

Algebraic Combinatorics and Computer Science pp 347–390Cite as

Catalan and other numbers: a recurrent theme

  • Chapter

Abstract

The Catalan numbers C n are, next to the binomial coefficients, the best studied of all combinatorial counting numbers. The wonderful book by Stanley [28] lists more than 70 instances of enumeration problems which are counted by the sequence (C n ). We will see several of them as we go along.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aigner, M. (1998): Motzkin numbers. European J. Combin. 19, 663–675

    Article  MathSciNet  MATH  Google Scholar 

  2. Aigner, M. (1999): Catalan-like numbers and determinants. J. Combin. Theory Ser. A 87, 33–51

    Article  MathSciNet  MATH  Google Scholar 

  3. Aigner, M. (1999): A characterization of the Bell numbers. Discrete Math. 205, 207–210

    Article  MathSciNet  MATH  Google Scholar 

  4. Aigner, M. (2000): Enumeration via ballot tables. Preprint

    Google Scholar 

  5. Barnabei, M., Brini, A., Nicoletti, G. (1982): Recursive matrices and umbral calculus. J. Algebra 75, 546–573

    Article  MathSciNet  MATH  Google Scholar 

  6. Barnabei, M., Montefusco, L.B. (1998): Recursive properties of Toeplitz and Hurwitz matrices. Linear Alg. Appl. 274, 367–388

    Article  MathSciNet  MATH  Google Scholar 

  7. Bernhart, F.R. (1999): Catalan, Motzkin and Riordan numbers. Discrete Math. 204, 73–112

    Article  MathSciNet  MATH  Google Scholar 

  8. Bousquet-Mélou, M. (1994): Polyominoes and polygons. In: Barcelo, H., Kalai, G. (eds.) Jerusalem Combinatorics’ 93. (Contemporary Mathematics, vol. 178). American Mathematical Society, Providence, RI, pp. 55–70

    Chapter  Google Scholar 

  9. Chihara, T.S. (1978): An introduction to orthogonal polynomials. Gordon and Breach, New York

    MATH  Google Scholar 

  10. Delest, M.-P., Fadou, J.M. (1993): Enumeration of skew Ferrers diagrams. Discrete Math. 112, 65–79

    Article  MathSciNet  MATH  Google Scholar 

  11. Delest, M.-P., Viennot, G. (1984): Algebraic languages and polynominoes enumeration. Theoret. Comput. Sci. 34, 169–206

    Article  MathSciNet  MATH  Google Scholar 

  12. Deutsch, E. (1999): Dyck path enumeration. Discrete Math. 204, 167–202

    Article  MathSciNet  MATH  Google Scholar 

  13. Donaghey, R., Shapiro, L.W. (1977): The Motzkin numbers. J. Combin. Theory Ser. A 23, 291–301

    Article  MathSciNet  MATH  Google Scholar 

  14. Flajolet, P. (1985): Combinatorial aspects of continued fractions. Discrete Math. 32, 125–161

    MathSciNet  Google Scholar 

  15. Gessel, I.M., Viennot, G. (1985): Binomial determinants, paths, and hook length formulae. Adv. Math. 58, 300–321

    Article  MathSciNet  MATH  Google Scholar 

  16. Goulden, I., Jackson, D. (1983): Combinatorial enumeration. Wiley, New York

    MATH  Google Scholar 

  17. Gouyou-Beauchamps, D., Viennot, G. (1988): Equivalence of the two-dimensional animal problem to a one-dimensional path problem. Adv. Appl. Math. 9, 334–357

    Article  MathSciNet  MATH  Google Scholar 

  18. Harary, F., Read, R. (1970): The enumeration of tree-like polyhexes. Proc. Edinburgh Math. Soc. 17, 1–13

    Article  MathSciNet  MATH  Google Scholar 

  19. Hofbauer, J., Fürlinger, J. (1985): q-Catalan numbers. J. Combin. Theory Ser. A 40, 248–264

    Article  MathSciNet  MATH  Google Scholar 

  20. Lindström, B. (1973): On the vector representation of induced matroids. Bull. London Math. Soc. 5, 85–90

    Article  MathSciNet  MATH  Google Scholar 

  21. Polýa, G. (1976): Problems and theorems in analysis, vol. II. Theory of functions, zeros, polynomials, determinants, number theory, geometry. Springer, Berlin

    Google Scholar 

  22. Roman, S. (1984): The umbral calculus. Academic Press, New York

    MATH  Google Scholar 

  23. Roman, S., Rota, G.-C. (1978): The umbral calculus. Adv. Math. 27, 95–188

    Article  MathSciNet  MATH  Google Scholar 

  24. Riordan, J. (1968): Combinatorial identities. Wiley, New York

    MATH  Google Scholar 

  25. Shapiro, L.W., Getu, S., Woan, W.-J., Woodson, L.C. (1991): The Riordan group. Discrete Appl. Math. 34, 229–239

    Article  MathSciNet  MATH  Google Scholar 

  26. Sprugnoli, R. (1994): Riordan arrays and combinatorial sums. Discrete Math. 132, 267–290

    Article  MathSciNet  MATH  Google Scholar 

  27. Stanley, R. (1997): Enumerative combinatorics, vol. I. (Cambridge Studies in Advanced Mathematics, vol. 49). Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  28. Stanley, R. (1999): Enumerative combinatorics, vol. 2. (Cambridge Studies in Advanced Mathematics, vol. 62). Cambridge University Press, Cambridge

    Book  Google Scholar 

  29. Viennot, G. (1984): Une théorie combinatoire des polynômes orthogonaux. Lecture Notes, Université de Quebec

    Google Scholar 

Download references

Authors
  1. M. Aigner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre d’Analyse et Mathematique Sociales, E.H.E.S.S. — C.N.R.S., Paris, France

    H. Crapo

  2. Dipartimento di Matematica, Università della Basilicata, Potenza, Italy

    D. Senato

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Italia

About this chapter

Cite this chapter

Aigner, M. (2001). Catalan and other numbers: a recurrent theme. In: Crapo, H., Senato, D. (eds) Algebraic Combinatorics and Computer Science. Springer, Milano. https://doi.org/10.1007/978-88-470-2107-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-88-470-2107-5_15

  • Publisher Name: Springer, Milano

  • Print ISBN: 978-88-470-2159-4

  • Online ISBN: 978-88-470-2107-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation