A Complete Enumeration of Ballot Permutations Avoiding Sets of Small Patterns

Nathan Sun

Published 2022-09-13Version 1

Permutations whose prefixes contain at least as many ascents as descents are called ballot permutations. Lin, Wang, and Zhao have previously enumerated ballot permutations avoiding small patterns and have proposed the problem of enumerating ballot permutations avoiding a pair of permutations of length $3$. We completely enumerate ballot permutations avoiding two patterns of length $3$ and we relate these avoidance classes with their respective recurrence relations and formulas, which leads to an interesting bijection between ballot permutations avoiding $132$ and $312$ with left factors of Dyck paths. In addition, we also conclude the Wilf-classification of ballot permutations avoiding sets of two patterns of length $3$, and we then extend our results to completely enumerate ballot permutations avoiding three patterns of length $3$.