Matchings In Three Catalan Lattices
From MaRDI portal
Publication:4805933
DOI10.1080/00207160304677zbMath1027.06011OpenAlexW4299558235MaRDI 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
existence theoremsmatchingCatalan numbersTamari latticeslattices of non-crossing partitionsCatalan lattices
Partitions of sets (05A18) Combinatorics on words (68R15) Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05)
Related Items (1)
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
This page was built for publication: Matchings In Three Catalan Lattices
