Conjecture on 210-avoiding ascent sequences and 3-noncrossing partitions
Let be the number of ascent sequences of length avoiding . A set partition of is 3-noncrossing if it has no 3-crossing. The 210 counting conjecture. equals the number of 3-noncrossing set partitions of .
References
Status
- Solved: Sherry H. F. Yan. Ascent Sequences and 3-Nonnesting Set Partitions (arXiv, 2012) https://arxiv.org/abs/1208.1915
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.