The periodic-point avoidance conjecture for consecutive-pattern-avoiding stack-sorting maps

From papers

Let σSk\sigma\in S_k with k3k\geq 3. For a permutation, rev(σ)\operatorname{rev}(\sigma) denotes the reversal of σ\sigma, and underlined patterns indicate consecutive-pattern avoidance. The map SCσ:SnSn\operatorname{SC}_\sigma:S_n\to S_n is the consecutive-pattern-avoiding stack-sorting map.

Periodic-point avoidance conjecture. The periodic points of SCσ\operatorname{SC}_\sigma are precisely the permutations in

Avn(σ,rev(σ)).\operatorname{Av}_n\left(\underline{\sigma},\underline{\operatorname{rev}(\sigma)}\right).

The claim is confirmed in the paper when k=4k=4 and n8n\leq 8; the general assertion remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Colin Defant and Kai Zheng, “Stack-Sorting with Consecutive-Pattern-Avoiding Stacks”, arXiv:2008.12297 (2020).

Solutions 0

No solutions have been posted yet.