A new lower bound for deterministic pop-stack-sorting
arXiv:2307.08188 · doi:10.1016/j.ejc.2024.104046
Abstract
The pop-stack-sorting process is a variation of the stack-sort process. We consider a deterministic version of this process, and provide a new lower bound of for the number of sorts to fully sort a uniformly randomly chosen permutation via a useful lemma.
European Journal of Combinatorics