A new family of Fibonacci-counted Dyck path lattices is shown to admit exact interval and irreducible-element enumerations, plus bijections to compositions, Catalan words, and Motzkin paths.
A lattice on Dyck paths close to the Tamari lattice
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We introduce a new poset structure on Dyck paths where the covering relation is a particular case of the relation inducing the Tamari lattice. We prove that the transitive closure of this relation endows Dyck paths with a lattice structure. We provide a trivariate generating function counting the number of Dyck paths with respect to the semilength, the numbers of outgoing and incoming edges in the Hasse diagram. We deduce the numbers of coverings, meet and join irreducible elements. As a byproduct, we present a new involution on Dyck paths that transports the bistatistic of the numbers of outgoing and incoming edges into its reverse. Finally, we give a generating function for the number of intervals, and we compare this number with the number of intervals in the Tamari lattice.
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Intervals in a family of Fibonacci lattices
A new family of Fibonacci-counted Dyck path lattices is shown to admit exact interval and irreducible-element enumerations, plus bijections to compositions, Catalan words, and Motzkin paths.