Burstein–Jones conjecture on Dumont permutations
For every integer , the numbers of Dumont permutations of the first kind of length avoiding the patterns and are equal: , where denotes the set of Dumont permutations of the first kind of length that avoid the pattern .
References
- Two refined Wilf-equivalences for patterns of length 4 and a conjecture on Dumont permutations of the first kind — arXiv — Zuo-Ru Zhang, Hongkuan Zhao
Source: arXiv
Progress summary
A new preprint claims to prove the conjecture by giving a structure-preserving matching, but the claim has not been independently checked.
The Burstein–Jones conjecture asserts that the patterns and are Wilf-equivalent on Dumont permutations of the first kind: for every . It was discussed at permutation-pattern meetings in and after computations verified equality through length .
Known results
- Equality was computationally checked through Dumont permutations of length ; an earlier enumeration required correction.
- The conjecture was recorded as Conjecture in the earlier enumeration paper, with no proof then known.
Recent preprint
Zuo-Ru Zhang and Hongkuan Zhao construct an explicit bijection between - and -avoiding permutations preserving descent-top sets and reversing pinnacle words. Restricting it to Dumont permutations yields a refined equivalence and the conjectured enumeration equality. The claimed proof is not independently assessed in the retrieved sources.
Current status (as of October 2026): The conjecture has a direct claimed proof via an explicit bijection, but that proof remains unverified; the broader refined Wilf-equivalence program is open.
Solutions 0
No solutions have been posted yet.