The stabilization-time conjecture for the map \operatorname{SC}_{231}

About 6 years old · traced to

Let n≥3n\geq 3, let SnS_n be the set of permutations of [n][n], and let Av⁡n(132,231)\operatorname{Av}_n(132,231) denote the permutations avoiding 132132 and 231231.

Stabilization-time conjecture. For every π∈Sn\pi\in S_n,

SC⁡2312n−4(π)∈Av⁡n(132,231).\operatorname{SC}_{231}^{2n-4}(\pi)\in\operatorname{Av}_n(132,231).

Furthermore, there exists τ∈Sn\tau\in S_n such that

SC⁡2312n−5(τ)∉Av⁡n(132,231).\operatorname{SC}_{231}^{2n-5}(\tau)\notin\operatorname{Av}_n(132,231).

The conjecture has been verified for n≤9n\leq 9 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.