Repository | Book | Chapter
(2001) Algebraic combinatorics and computer science, Dordrecht, Springer.
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
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, pp. 347-390.
This document is unfortunately not available for download at the moment.