The number of coverings in four catalan lattices

DOI10.1080/00207169608804497zbMath1001.05500OpenAlexW2036589545MaRDI QIDQ2710772

No author found.

Publication date: 19 December 2002

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

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

zbMATH Keywords

coveringslatticesbinary treesbinary bracketings

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial aspects of packing and covering (05B40)

Related Items (7)

Two shortest path metrics on well-formed parentheses strings ⋮ The pruning-grafting lattice of binary trees ⋮ Matchings In Three Catalan Lattices ⋮ An efficient algorithm for estimating rotation distance between two binary trees ⋮ The phagocyte lattice of Dyck words ⋮ On the Categories of Modules Over the Tamari Posets ⋮ An efficient upper bound of the rotation distance of binary trees

Cites Work

• Unnamed Item
• Chain enumeration and non-crossing partitions
• Enumerations of ordered trees
• Catalan numbers, their generalization, and their uses
• On the structure of the lattice of noncrossing partitions
• Une bijection entre arbres binaires et certaines matrices de Jacobi. (A one-to-one correspondence between binary trees and certain Jacobi matrices)
• Primes, irreducibles and extremal lattices
• A topological representation theory for lattices
• On Tamari lattices
• A-transformation dans les arbres n-aires
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Generating binary trees by transpositions
• Short notes: Some Properties of the Rotation Lattice of Binary Trees
• A note on generating binary trees inA-order andB-order
• Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
• Catalan numbers revisited

This page was built for publication: The number of coverings in four catalan lattices