2017/04/13 by Mansour, Toufik, Skogman, Howard, Smith, Rebecca
#05A05 #05A15 #06A07 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1704.04288
We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation π to be k-pass sortable if π is sortable using k passes through the stack. Permutations that are 1-pass sortable are simply the stack sortable permutations as defined by Knuth. We define the permutation class of 2-pass sortable permutations in terms of their basis. We also show all k-pass sortable classes have finite bases by giving bounds on the length of a basis element of the permutation class for any positive integer k. Finally, we define the notion of tier of a permutation π to be the minimum number of passes after the first pass required to sort π. We then give a bijection between the class of permutations of tier t and a collection of integer sequences studied by Parker. This gives an exact enumeration of tier t permutations of a given length and thus an exact enumeration for the class of (t+1)-pass sortable permutations. Finally, we give a new derivation for the generating function in Parker's thesis and an explicit formula for the coefficients.