Enumeration Schemes for Permutations Avoiding Barred Patterns

Abstract

We give the first comprehensive collection of enumeration results for permutations that avoid barred patterns of length $\leq 4$. We then use the method of prefix enumeration schemes to find recurrences counting permutations that avoid a barred pattern of length $>4$ or a set of barred patterns.

• PDF