Dyck paths with catastrophes modulo the positions of a given pattern
Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian

TL;DR
This paper studies Dyck paths with catastrophes, classifying them based on the positions of small patterns, and provides generating functions and asymptotic formulas for their enumeration.
Contribution
It introduces a novel framework for analyzing Dyck paths with catastrophes through pattern-based equivalence classes and derives explicit generating functions.
Findings
Derived generating functions for p-equivalence classes
Provided asymptotic approximations for class counts
Established enumeration formulas for small pattern cases
Abstract
For any pattern of length at most two, we provide generating functions and asymptotic approximations for the number of -equivalence classes of Dyck paths with catastrophes, where two paths of the same length are -equivalent whenever the positions of the occurrences of the pattern are the same.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Stochastic processes and statistical mechanics · Quasicrystal Structures and Properties
