Matchings In Three Catalan Lattices
Let \(L\) be a lattice. Let \(J(L)\) (respectively \(M(L)\) denote the set of join-irreducible (respectively meet-irreducible) elements of \(L\). A matching of \(L\) is a bijective mapping \(\sigma\) of \(J(L)\cup \{0\}\) to \(M(L) \cup \{1\}\) for which \(j\leq \sigma(j)\) holds for each join-irreducible element \(j\). The Catalan lattices are a certain class of lattices enumerated by Catalan numbers. The paper gives constructions of matchings in three Catalan lattices. It mentions also the so-called Tamari lattices and lattices of non-crossing partitions.
- A distance metric on binary trees using lattice-theoretic measures
- A note on generating binary trees inA-order andB-order
- Enumerating, Ranking and Unranking Binary Trees
- Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
- Matching in modular lattices
- Matchings and Radon transforms in lattices II. Concordant sets
- Matchings and Radon transforms in lattices. I: Consistent lattices
- Matchings for linearly indecomposable modular lattices
- Noncrossing partitions
- On Tamari lattices
- On the structure of the lattice of noncrossing partitions
- Primes, irreducibles and extremal lattices
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- The number of coverings in four catalan lattices
- Two families of Newman lattices
- Two shortest path metrics on well-formed parentheses strings
- Matchings and Radon transforms in lattices. I: Consistent lattices
- Matchings for linearly indecomposable modular lattices
- The permuted analogues of three Catalan sets
- Perfect matchings in the triangular lattice
- The pruning-grafting lattice of binary trees
- Matchings and Radon transforms in lattices II. Concordant sets
- Matchings in the Partition Lattice
This page was built for publication: Matchings In Three Catalan Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4805933)