2022/02/23 by Baril, Jean-Luc, Kirgizov, Sergey, Petrossian, Armen
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.2202.11627
For any pattern p of length at most two, we provide generating functions and asymptotic approximations for the number of p-equivalence classes of Dyck paths with catastrophes, where two paths of the same length are p-equivalent whenever the positions of the occurrences of the pattern p are the same.