Conjecture on 0123-avoiding ascent sequences and bounded-height Dyck paths

Let A0123(n)A_{0123}(n) be the number of ascent sequences of length nn avoiding 01230123. A Dyck path of semilength nn has height at most 55 if its maximum vertical height is at most 55. The 0123 Dyck-path conjecture. A0123(n)A_{0123}(n) equals the number of Dyck paths of semilength nn and height at most 55. 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.