Cyclic pattern containment and avoidance (Q2078930): Difference between revisions

The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. \textit{A. Vella} [Electron. J. Comb. 9, No. 2, Research paper R18, 43 p. (2003; Zbl 1035.05010)] and \textit{D. Callan} [``Pattern avoidance in circular permutations'', Preprint, \url{arXiv:math/0210014}] independently initiated the study of permutation avoidance in cyclic permutations and characterized the avoidance classes for all single permutations of length 4. The authors derive results about avoidance of multiple patterns of length 4, and they determine generating functions for the cyclic descent statistic on these classes. They also consider consecutive pattern containment, and relate the generating functions for the number of occurrences of certain linear and cyclic patterns. Finally, they provide various open questions and avenues for future research.