2024/02/02 by Prodinger, Helmut
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2402.01429
Stanley considered Dyck paths where each maximal run of down-steps to the x-axis has odd length; they are also enumerated by (shifted) Catalan numbers. Prefixes of these combinatorial objects are enumerated using the kernel method. A more challenging version of skew Dyck paths combined with Stanley's restriction is also considered.