Matchings In Three Catalan Lattices

DOI10.1080/00207160304677zbMath1027.06011MaRDI QIDQ4805933

Jean-Luc Baril, Jean-Marcel Pallo

Publication date: 14 January 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160304677

zbMATH Keywords

existence theorems; matching; Catalan numbers; Tamari lattices; lattices of non-crossing partitions; Catalan lattices

Mathematics Subject Classification ID

05A18: Partitions of sets

68R15: Combinatorics on words

06A07: Combinatorics of partially ordered sets

06B05: Structure theory of lattices

Related Items

The pruning-grafting lattice of binary trees

Cites Work

• Two shortest path metrics on well-formed parentheses strings
• A distance metric on binary trees using lattice-theoretic measures
• Matchings and Radon transforms in lattices. I: Consistent lattices
• Matchings for linearly indecomposable modular lattices
• Matching in modular lattices
• On the structure of the lattice of noncrossing partitions
• Primes, irreducibles and extremal lattices
• On Tamari lattices
• Two families of Newman lattices
• Noncrossing partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• The number of coverings in four catalan lattices
• Matchings and Radon transforms in lattices II. Concordant sets
• Enumerating, Ranking and Unranking Binary Trees
• A note on generating binary trees inA-order andB-order
• Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time