Cyclic pattern containment and avoidance
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.
- A proof of the peak polynomial positivity conjecture
- A proof of the peak polynomial positivity conjecture
- A survey of consecutive patterns in permutations
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Coefficients and roots of peak polynomials
- Combinatorics: the art of counting
- Consecutive patterns in permutations
- Continued fractions for permutation statistics
- Cyclic permutations realized by signed shifts
- Enriched 𝑃-Partitions
- Erdős-Szekeres theorem for cyclic permutations
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generalized permutation patterns and a classification of the Mahonian statistics
- Generating functions for generating trees
- Generating functions for permutations avoiding a consecutive pattern
- Generating trees and forbidden subsequences
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- Multi-avoidance of generalised patterns
- On meteors, earthworms and wimps
- On rotated Schur-positive sets
- Pattern avoidance in ``flattened partitions
- Pattern avoidance in permutations: Linear and cyclic orders
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Pattern avoiding partitions, sequence A054391, and the kernel method
- Pattern containment in circular permutations
- Patterns in colored circular permutations
- Peak sets of classical Coxeter groups
- Permutation patterns and statistics
- Permutations and words counted by consecutive patterns
- Permutations with forbidden subsequences and a generalized Schröder number
- Permutations with given peak set
- Restricted permutations
- Schur-positive sets of permutations via products and grid classes
- Shuffle algebras, homology, and consecutive pattern avoidance
- The most and the least avoided consecutive patterns
- The number of Baxter permutations
- The number of permutations with the same peak set for signed permutations
- Vincular pattern avoidance on cyclic permutations
- Pattern avoidance in permutations: Linear and cyclic orders
- Patterns in colored circular permutations
- Cyclic shuffle compatibility
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Pinnacle set properties
- Pattern containment in circular permutations
- Cyclically consecutive permutation avoidance
- On a question of Li concerning an uncounted class of circular permutations
- Cyclic and lift closures for \(k \ldots 21\)-avoiding permutations
- Cyclic permutations avoiding patterns in both one-line and cycle forms
- Pattern avoidance of cyclic permutations
- A combinatorial proof of a symmetry for a refinement of the Narayana numbers
- Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
This page was built for publication: Cyclic pattern containment and avoidance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2078930)
