Generating trees and the Catalan and Schröder numbers

Discrete Mathematics

Volumn 146, Issue 1-3, 1995, Pages 247-262

  West, Julian ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000464149     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00067-1     Document Type: Article

References (26)

1. Discrete representation theory for semiorders
2. Some q-analogues of the Schroder numbers arising from combinatorial statistics on lattice paths
3. Note sur une équation aux différences finies
4. The number of baxter permutations
5. Permutations à motifs exclus et cartes planaires non séparables
6. Symmetric functions and p-recursiveness
7. Arbres, permutations à motifs exclus et cartes planaire: quelques problèmes algorithmiques et combinatoires
8. Deux propriétés combinatoires des nombres de Schroder
9. Schubert polynomials and the Littlewood-Richardson rule
10. Asymptotic values for degrees associated with strips of young diagrams
11. Ballot sequences and restricted permutations
12. Some correspondences involving the Schroder numbers and relations
13. Longest increasing and decreasing subsequences
14. Vier combinatorische probleme
15. Boostrap percolation the Schroder numbers and the n-kings problem
16. Restricted permutations
17. Forbidden subsequences
18. Discrete representations of semiorders
19. Permutations with forbidden subsequences and stack-sortable permutations