ABSTRACT
Stack sorting Stack sorting of permutations has been defined in [20], and has been the subject of intensive research. It is concerned with the operation of sorting permutations by passing them through a stack. This operation has many variations, and we have surveyed them in [6], and, also, in Chapter 8 of [7]. However, in this paper, we will restrict our attention to the most vigorously studied version, that is sometimes called West stack sorting, or right-greedy stack sorting.
