Chains of maximum length in the Tamari lattice
Authors:
- 11 June 2014
- journal article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 142 (10) , 3343-3353
Abstract
The Tamari lattice <!-- MATH $\mathcal {T}_n$ --> was originally defined on bracketings of a set of objects, with a cover relation based on the associativity rule in one direction. Although in several related lattices the number of maximal chains is known, quoting Knuth, ``The enumeration of such paths in Tamari lattices remains mysterious.''
Keywords
This publication has 16 references indexed in Scilit:
- Permutahedra and generalized associahedraAdvances in Mathematics, 2011
- Intervals in Catalan lattices and realizers of triangulationsJournal of Combinatorial Theory, Series A, 2009
- Cambrian latticesAdvances in Mathematics, 2006
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length threeAdvances in Applied Mathematics, 2003
- Dual equivalence with applications, including a conjecture of ProctorDiscrete Mathematics, 1992
- Balanced tableauxAdvances in Mathematics, 1987
- On the Number of Reduced Decompositions of Elements of Coxeter GroupsEuropean Journal of Combinatorics, 1984
- Problems of associativity: A simple proof for the lattice property of systems ordered by a semi-associative lawJournal of Combinatorial Theory, Series A, 1972
- Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associativeJournal of Combinatorial Theory, 1967
- A problem of arrangementsDuke Mathematical Journal, 1947