Chains of maximum length in the Tamari lattice
From MaRDI portal
Publication:3190318
DOI10.1090/S0002-9939-2014-12069-7zbMath1326.06006OpenAlexW2035322568MaRDI QIDQ3190318
Publication date: 16 September 2014
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-2014-12069-7
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Combinatorics of partially ordered sets (06A07)
Related Items (10)
The Tamari block lattice: an order on saturated chains in the Tamari lattice ⋮ Recursive constructions for the higher Stasheff-Tamari orders in dimension three using the outer Tamari and Tamari block posets ⋮ Ungarian Markov chains ⋮ A catalanization map on the symmetric group ⋮ A recursion on maximal chains in the Tamari lattices ⋮ Modular Catalan numbers ⋮ Random strict partitions and random shifted tableaux ⋮ On random shifted standard Young tableaux and 132-avoiding sorting networks ⋮ On random shifted standard Young tableaux and 132-avoiding sorting networks ⋮ Properties of the Edelman-Greene bijection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutahedra and generalized associahedra.
- The number of intervals in the \(m\)-Tamari lattices
- Intervals in Catalan lattices and realizers of triangulations
- On the number of reduced decompositions of elements of Coxeter groups
- Dual equivalence with applications, including a conjecture of Proctor
- Primes, irreducibles and extremal lattices
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
- Balanced tableaux
- Higher trivariate diagonal harmonics via generalized Tamari posets
- Cambrian lattices.
- Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
- A problem of arrangements
- Combinatorics of Coxeter Groups
- Shellable nonpure complexes and posets. II
- Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
- A combinatorial problem
- An area-to-inv bijection between Dyck paths and 312-avoiding permutations
- Permutations with restricted patterns and Dyck paths
This page was built for publication: Chains of maximum length in the Tamari lattice