Pattern avoidance in permutations and their rotations

A rotation of a permutation is a new permutation obtained by moving the first several terms of the permutation to the end of the permutation.

A circular permutation is the set of all rotations of a permutation.

The enumerations of permutations and circular permutations avoiding patterns of length three and four are well studied.

In this paper, we provide exact formulas for the number of permutations whose first $k\geq 2$ rotations all avoid a given pattern of length three, as well as the number of permutations whose first three rotations respectively avoid the rotations of a given pattern of length three.

In contrast to permutations and circular permutations avoiding patterns of length three, the Wilf-equivalence classes under study are entirely determined by complements and reverses.

We also classify and enumerate permutations whose first two rotations avoid different patterns of length three.