Vincular pattern avoidance on cyclic permutations
From MaRDI portal
Publication:6156004
Abstract: Pattern avoidance for permutations has been extensively studied, and has been generalized to vincular patterns, where certain elements can be required to be adjacent. In addition, cyclic permutations, i.e., permutations written in a circle rather than a line, have been frequently studied, including in the context of pattern avoidance. We investigate vincular pattern avoidance on cyclic permutations. In particular, we enumerate many avoidance classes of sets of vincular patterns of length 3, including a complete enumeration for all single patterns of length 3. Further, several of the avoidance classes corresponding to a single vincular pattern of length 4 are enumerated by the Catalan numbers. We then study more generally whether sets of vincular patterns of an arbitrary length can be avoided for arbitrarily long cyclic permutations, in particular investigating the boundary cases of minimal unavoidable sets and maximal avoidable sets.
Recommendations
- Pattern avoidance in permutations: Linear and cyclic orders
- Cyclically consecutive permutation avoidance
- Pattern avoidance of generalized permutations
- Pattern avoidance in partial permutations
- Enumerating pattern avoidance for affine permutations
- On pattern avoiding alternating permutations
- Pattern avoidance in poset permutations
- Avoiding patterns in irreducible permutations
- Pattern avoiding meandric permutations
- On pattern avoiding indecomposable permutations
Cites work
- scientific article; zbMATH DE number 5072523 (Why is no real title available?)
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- A survey of alternating permutations
- Classification of bijections between 321- and 132-avoiding permutations
- Counting Arrangements of 1's and -1's
- Counting strings in Dyck paths
- Cyclic ordering is NP-complete
- Cyclically consecutive permutation avoidance
- Enumeration schemes for permutations avoiding barred patterns
- Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons
- Generalized pattern avoidance
- Generalized permutation patterns -- a short survey
- Generalized permutation patterns and a classification of the Mahonian statistics
- Multi-static enumeration of two-stack sortable permutations
- Non-overlapping partitions, continued fractions, Bessel functions and a divergent series
- Partial and complete cyclic orders
- Patterns in permutations and words.
- Refined enumeration of permutations sorted with two stacks and a D₈-symmetry
- Restricted partitions and generalized Catalan numbers
- The patterns of permutations
Cited in
(9)- Enumeration schemes for vincular patterns
- Some results on the avoidance of vincular patterns by multisets
- Pattern-restricted permutations composed of 3-cycles
- Cyclic and lift closures for \(k \ldots 21\)-avoiding permutations
- On a question of Li concerning an uncounted class of circular permutations
- Enumerations of permutations simultaneously avoiding a vincular and a covincular pattern of length 3
- Cyclic pattern containment and avoidance
- On cyclic strings avoiding a pattern
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
This page was built for publication: Vincular pattern avoidance on cyclic permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156004)
