← All problems

Conjecture on 210-avoiding ascent sequences and 3-noncrossing partitions

14 years old · documented by

Let A210(n)A_{210}(n) be the number of ascent sequences of length nn avoiding 210210. A set partition of {1,2,…,n}\{1,2,\ldots,n\} is 3-noncrossing if it has no 3-crossing. The 210 counting conjecture. A210(n)A_{210}(n) equals the number of 3-noncrossing set partitions of {1,2,…,n}\{1,2,\ldots,n\}.

References

Status

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.