Sorting
We introduce an algorithm to determine when a sorting operation, such as
stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a
new proof of the description of West-2-stack-sortable permutations, that is
permutations that are completely sorted when passed twice through a stack, in
terms of patterns. We also solve the long-standing problem of describing
West-3-stack-sortable permutations. This requires a new type of generalized
permutation pattern we call a decorated pattern.
Permutation classes from sorting
A showcase of the permutation classes and sets that come from sorting with stacks, queues, pop-stacks and deques, and with sorting maps such as West’s stack-sorting map and bubble sort, with their combinatorial specifications: which machines sort a permutation, how the classes and sets sit among each other, how a specification builds a permutation, step by step, and each machine at work, move by move. The showcase