We study permutations that avoid two distinct patterns of length three and any additional set of patterns. We begin by showing how to enumerate these permutations using generating trees, generalizing the work of Mansour [13]. We then find sucient conditions for when the number of such permutations is given by a polynomial and answer a question of Egge [6]. Afterwards, we show how to use these computations to count permutations that avoid two distinct patterns of length three and contain other patterns a prescribed number of times.
['Vincent Vatter']
Permutations Avoiding Two Patterns of Length Three