2019/11/08 by Baril, Jean-Luc, Genestier, Richard, Kirgizov, Sergey · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1911.03119
We provide generating functions for the popularity and the distribution of patterns of length at most three over the set of Dyck paths having a first return decomposition constrained by height.