Defant and Zheng's maximal-time conjecture for the consecutive-pattern-avoiding stack-sorting map
Statement
Let be the set of permutations of length , let be the stack-sorting map whose stack avoids consecutive occurrences of , and let denote the set of permutations in avoiding and consecutively. Defant and Zheng's conjecture. For any permutation of length ,
Also, for every , there exists for which
The paper states this as a conjecture of Defant and Zheng and presents a counterexample, so the asserted universal claim is refuted; the first displayed bound is instead proved in the paper's main theorem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.