English

Highly Sorted Permutations and Bell Numbers

Combinatorics 2020-12-08 v1

Abstract

Let ss denote West's stack-sorting map. For all positive integers mm and all integers n2m2n\geq 2m-2, we give a simple characterization of the set snm(Sn)s^{n-m}(S_n); as a consequence, we find that snm(Sn)|s^{n-m}(S_n)| is the mthm^\text{th} Bell number BmB_m. We also prove that the restriction n2m2n\geq 2m-2 is tight by showing that sm3(S2m3)=Bm+m2|s^{m-3}(S_{2m-3})|=B_m+m-2 for all m3m\geq 3.

Keywords

Cite

@article{arxiv.2012.03869,
  title  = {Highly Sorted Permutations and Bell Numbers},
  author = {Colin Defant},
  journal= {arXiv preprint arXiv:2012.03869},
  year   = {2020}
}

Comments

8 pages, 1 figure

R2 v1 2026-06-23T20:47:23.587Z