Conjecture on 0123-avoiding ascent sequences and bounded-height Dyck paths
Conjecture on 0123-avoiding ascent sequences and bounded-height Dyck paths
Let be the number of ascent sequences of length avoiding . A Dyck path of semilength has height at most if its maximum vertical height is at most . The 0123 Dyck-path conjecture. equals the number of Dyck paths of semilength and height at most . The conjecture identifies the enumeration of 0123-avoiding ascent sequences with a bounded-height Dyck-path family; the source gives no resolution.
Sources & referencesView supporting material
Primary source
Paul Duncan and Einar Steingrimsson, “Pattern avoidance in ascent sequences”, arXiv:1109.3641 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.