Central and East European
Society for Phenomenology

Repository | Book | Chapter

193285

Catalan and other numbers

a recurrent theme

M. Aigner

pp. 347-390

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.

Publication details

Published in:

Crapo Henry, Senato Domenico (2001) Algebraic combinatorics and computer science: a tribute to Gian-Carlo Rota. Dordrecht, Springer.

Pages: 347-390

DOI: 10.1007/978-88-470-2107-5_15

Full citation:

Aigner M. (2001) „Catalan and other numbers: a recurrent theme“, In: H. Crapo & D. Senato (eds.), Algebraic combinatorics and computer science, Dordrecht, Springer, 347–390.