Vincular pattern avoidance on cyclic permutations
From MaRDI portal
Publication:6156004
DOI10.54550/eca2022v2s4pp3zbMath1512.05017arXiv2107.12353MaRDI QIDQ6156004
Publication date: 9 June 2023
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.12353
Related Items (3)
Pattern avoidance of \([4,k\)-pairs in circular permutations] ⋮ Unnamed Item ⋮ Cyclic pattern containment and avoidance
Cites Work
- Unnamed Item
- Unnamed Item
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
- Patterns in permutations and words.
- Non-overlapping partitions, continued fractions, Bessel functions and a divergent series
- 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)\)!)
- Cyclic ordering is NP-complete
- Multi-static enumeration of two-stack sortable permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons
- The patterns of permutations
- Enumeration schemes for permutations avoiding barred patterns
- Counting strings in Dyck paths
- Classification of bijections between 321- and 132-avoiding permutations
- A Survey of Alternating Permutations
- Generalized permutation patterns -- a short survey
- Partial and complete cyclic orders
- Counting Arrangements of 1's and -1's
- Cyclically Consecutive Permutation Avoidance
- Generalized pattern avoidance
This page was built for publication: Vincular pattern avoidance on cyclic permutations