Lower bound on the running time of Pop-Stack Sorting on a random permutation

Lyuben Lichev

Home/Archive/arXiv

arXiv · 2212.09316

Lower bound on the running time of Pop-Stack Sorting on a random permutation

Lyuben Lichev

View original source ↗Read source document ↗Export metadata ↓

Abstract

Pop-Stack Sorting is an algorithm that takes a permutation as an input and sorts its elements. It consists of several steps. At one step, the algorithm reads the permutation it has to process from left to right and reverses each of its maximal decreasing subsequences of consecutive elements. It terminates at the first step that outputs the identity permutation. In this note, we answer a question of Defant on the running time of Pop-Stack Sorting on the uniform random permutation $\sigma_n$. More precisely, we show that there is a constant $c > 0.5$ such that asymptotically almost surely, the algorithm needs at least $cn$ steps to terminate on $\sigma_n$.

Explore related subjects

math.PR cs.DS math.CO

Keep this discovery

BibTeX RIS

Lyuben Lichev. 2022-12-19. Lower bound on the running time of Pop-Stack Sorting on a random permutation. https://arxiv.org/abs/2212.09316

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR↗

arXiv2026

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR↗

arXiv2026

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR↗