The stabilization-time conjecture for the map \operatorname{SC}_{231}
Let , let be the set of permutations of , and let denote the permutations avoiding and .
Stabilization-time conjecture. For every ,
Furthermore, there exists such that
The conjecture has been verified for and predicts the sharp number of iterations needed to reach the periodic-point set for this map.
References
Primary source
Colin Defant and Kai Zheng, “Stack-Sorting with Consecutive-Pattern-Avoiding Stacks”, arXiv:2008.12297 (2020).
Progress summary
Never refreshed
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.