A new lower bound for deterministic pop-stack-sorting
Combinatorics
2024-08-26 v2 Probability
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.
Cite
@article{arxiv.2307.08188,
title = {A new lower bound for deterministic pop-stack-sorting},
author = {Morgan Bauer and Keith Copenhaver},
journal= {arXiv preprint arXiv:2307.08188},
year = {2024}
}
Comments
European Journal of Combinatorics