Zhang–Kitaev equinumerosity conjecture for 213- and 321-avoiding permutations
Let be the set of permutations of length that become the identity after applications of the stack-sorting operation, and let denote those that avoid the pattern . Zhang–Kitaev's conjecture. For every ,
The paper constructs a bijection proving this equality, so the conjecture is solved.
References
- Yang Li, Sergey Kitaev, Zhicong Lin and Jing Liu, “A bijection between 321- and 213-avoiding permutations preserving t-stack-sortability”, arXiv:2507.09187 (2025).
Progress summary
A 2025 paper claims a bijection proving the equality for every number of stack-sorting steps, together with a stronger statistical correspondence.
Zhang and Kitaev conjectured that the two classes of pattern-avoiding permutations have equal size after every number of stack-sorting steps. Yang Li, Sergey Kitaev, Zhicong Lin, and Jing Liu claim to settle this by constructing a bijection preserving -stack-sortability.
Known results
- Simion and Schmidt: the case was previously known.
- Zhang and Kitaev: the equality was previously verified for .
- The new theorem gives a refinement matching with .
July 12, 2025 claimed bijective proof
The arXiv paper A bijection between 321- and 213-avoiding permutations preserving -stack-sortability states that its bijection restricts to the -stack-sortable subsets, implying for every . The claim is unverified in the retrieved sources.
Current status (as of October 2026): The equality is claimed solved for every , but the claimed bijection has not been independently verified in the retrieved sources.
Solutions 0
No solutions have been posted yet.