Duncan–Steingrímsson's bistatistic equidistribution conjecture for 021-avoiding ascent sequences
An ascent sequence of length is a nonnegative integer sequence with and for , where is the number of ascents in the prefix. Let be the set of ascent sequences avoiding the pattern , and let be the set of permutations in avoiding . For a sequence , let be the number of right-to-left minima, meaning indices such that for every . Duncan–Steingrímsson's conjecture. The bistatistic has the same distribution over and .
References
Status
- Solved: William Y.C. Chen, Alvin Y.L. Dai, Theodore Dokos, Tim Dwyer, and Bruce E. Sagan. On 021-Avoiding Ascent Sequences (The Electronic Journal of Combinatorics, 2013) https://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p76
Source: William Y. C. Chen, Alvin Y. L. Dai, Theodore Dokos, Tim Dwyer and Bruce E. Sagan, “On 021-Avoiding Ascent Sequences”, arXiv:1206.2849 (2012).
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
No solutions have been posted yet.