← All problems

Burstein–Jones conjecture on Dumont permutations

For every integer n≥0n\ge 0, the numbers of Dumont permutations of the first kind of length 2n2n avoiding the patterns 21432143 and 34213421 are equal: ∣D2n1(2143)∣=∣D2n1(3421)∣\lvert D^{1}_{2n}(2143)\rvert=\lvert D^{1}_{2n}(3421)\rvert, where D2n1(τ)D^{1}_{2n}(\tau) denotes the set of Dumont permutations of the first kind of length 2n2n that avoid the pattern τ\tau.

References

Progress summary

Refreshed
Open · solution reported

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 21432143 and 34213421 are Wilf-equivalent on Dumont permutations of the first kind: ∣D2n1(2143)∣=∣D2n1(3421)∣|D^{1}_{2n}(2143)|=|D^{1}_{2n}(3421)| for every n≥0n\geq 0. It was discussed at permutation-pattern meetings in 20162016 and 20182018 after computations verified equality through length 2020.

Known results

  • Equality was computationally checked through Dumont permutations of length 2020; an earlier enumeration required correction.
  • The conjecture was recorded as Conjecture 5.15.1 in the earlier enumeration paper, with no proof then known.

Recent preprint

Zuo-Ru Zhang and Hongkuan Zhao construct an explicit bijection between 21432143- and 34213421-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.

Sources

Solutions 0

No solutions have been posted yet.