Stack-sorting with consecutive-pattern-avoiding stacks (Q2035992)

The authors consider a variation on pattern avoidance in permutations, and specifically in stack sorting of permutations. In speaking of a pattern \(p\) matching a permutation, classically one considers any subsequence of the permutation whose ordering corresponds to the relative ordering described by \(p\). In the paper under review, however, the authors consider only contiguous subsequences that are matched by \(p\). They characterize the stack-sortable permutations in some cases and also determine some enumeration results. They go on to study the dynamics of their stack-sorting maps, and characterize the periodic points. The paper closes with a number of conjectures and open problems.