Burstein’s conjecture on descent-top sets
For every and every subset , the numbers of permutations in the two avoidance classes having descent-top set are equal:
Here denotes the set of permutations of avoiding the pattern , and is the set of values occurring at the tops of descents.
References
Primary source
Additional references
- Descent Tops and Pinnacles on 2143- and 3421-Avoiding Permutations — arXiv — Yue Dong, Lily Li Liu, Tongyuan Zhao
Progress summary
A 2026 preprint claims to settle the conjecture with an explicit reversible matching between the two permutation classes, but the result has not been independently checked.
Burstein’s conjecture asserts equality of descent-top distributions for permutations avoiding and . A new preprint by Yue Dong, Lily Li Liu, and Tongyuan Zhao claims a stronger bijective result, also controlling pinnacle data.
Known results
- Burstein’s revised paper, accepted January 7, 2025, established related descent-top equidistributions for shorter patterns and recorded analogous length- conjectures.
- Zhou, Zang, and Yan reportedly proved those related length- conjectures in 2024.
October 2026 claimed bijective proof
The preprint constructs an explicit bijection preserving descent-top sets and reversing pinnacle words. It therefore claims the conjecture and a refined Dumont-permutation consequence, but the preprint is unrefereed and no independent verification was found.
Current status (as of October 2026): A preprint claims the conjecture is solved by an explicit bijection, while independent verification of that proof is not recorded.
Solutions 0
No solutions have been posted yet.