2000 character limit reached
Highly Sorted Permutations and Bell Numbers
Published 7 Dec 2020 in math.CO | (2012.03869v1)
Abstract: Let $s$ denote West's stack-sorting map. For all positive integers $m$ and all integers $n\geq 2m-2$, we give a simple characterization of the set $s{n-m}(S_n)$; as a consequence, we find that $|s{n-m}(S_n)|$ is the $m\text{th}$ Bell number $B_m$. We also prove that the restriction $n\geq 2m-2$ is tight by showing that $|s{m-3}(S_{2m-3})|=B_m+m-2$ for all $m\geq 3$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.