Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations

Abstract

Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of length four by establishing bijections between these classes and various lattice paths. This allows us to prove nine conjectures of Defant.

Keywords

• mathematics - combinatorics
• 05a05, 05a15
• g.2.1