Abstract
The pop-stack-sorting process is a variation of the stack-sorting process. We consider a deterministic version of this process. We prove a lemma which characterises interior elements of increasing runs after t iterations of the process and provide a new lower bound of 35n for the number of iterations of the process to fully sort a uniformly randomly chosen permutation of length n.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call