Highly Sorted Permutations and Bell Numbers

Abstract

Let s denote West's stack-sorting map. For all positive integers m and all integers n≥ 2m-2, we give a simple characterization of the set sn-m(Sn); as a consequence, we find that |sn-m(Sn)| is the mth Bell number Bm. We also prove that the restriction n≥ 2m-2 is tight by showing that |sm-3(S2m-3)|=Bm+m-2 for all m≥ 3.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…