A new lower bound for deterministic pop-stack-sorting
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 35n for the number of sorts to fully sort a uniformly randomly chosen permutation via a useful lemma.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.