Cyclic permutations avoiding patterns in both one-line and cycle forms
From MaRDI portal
Cites work
- Alternating permutations and symmetric functions
- An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
- Boolean intersection ideals of permutations in the Bruhat order
- Cyclic pattern containment and avoidance
- Cyclic permutations realized by signed shifts
- Enumerating two permutation classes by the number of cycles
- Enumeration of cyclic permutations in vector grid classes
- Exact and asymptotic enumeration of cyclic permutations according to descent set
- On a conjecture about strong pattern avoidance
- Pattern avoidance and the fundamental bijection
- Pattern avoidance in permutations and their squares
- Pattern avoidance in permutations: Linear and cyclic orders
- Pattern-avoiding permutation powers
- Pattern-functions, statistics, and shallow permutations
- Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
- Pattern-restricted permutations composed of 3-cycles
- Refined restricted involutions
- Restricted 123-involutions
- Restricted permutations
- The X-class and almost-increasing permutations
- Unimodal permutations and almost-increasing cycles
This page was built for publication: Cyclic permutations avoiding patterns in both one-line and cycle forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839567)
