2024/11/26 by Baril, Jean-Luc, Hassler, Nathanaël · 1 citation
#05A15 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2411.17628
We focus on a family of subsets (\Fpn)p≥ 2 of Dyck paths of semilength n that avoid the patterns DUU and Dp+1, which are enumerated by the generalized Fibonacci numbers. We endow them with the partial order relation induced by the well-known Stanley lattice, and we prove that all these posets are sublattices of the Stanley lattice. We provide generating functions for the numbers of linear and boolean intervals and we deduce the Möbius function for every p≥ 2. We count meet-irreducible elements in \FFnp which establishes a surprising link with the edges of the (n,p)-Turán graph. We also prove that intervals are in one-to-one correspondence with bicolored Motzkin paths avoiding some patterns, which allows to enumerate intervals for p=2. Using a discrete continuity argument (p→ ∞), we present a similar enumerative study in a poset of some Dyck paths of semilength n counted by 2n-1. Finally, we give bijections that transport the lattice structure on other combinatorial objects, proving that those lattices can be seen as the well-known dominance order on some compositions.