Groups generated by pattern avoiding permutations
Preprint
Abstract
We study groups generated by sets of pattern avoiding permutations. In the first part of the paper we prove some general results concerning the structure of such groups. In the second part we carry out a case-by-case analysis of groups generated by permutations avoiding few short patterns.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Pattern-avoiding permutation powersDiscrete Mathematics, 2020
- Growth rates of permutation classes: Categorization up to the uncountability thresholdIsrael Journal of Mathematics, 2020
- Permutation groups arising from pattern involvementJournal of Algebraic Combinatorics, 2019
- Composability of Permutation ClassesThe Electronic Journal of Combinatorics, 2019
- Permutation groups, pattern involvement, and Galois connectionsActa Scientiarum Mathematicarum, 2017
- On the effective and automatic enumeration of polynomial permutation classesJournal of Symbolic Computation, 2016
- PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188Mathematika, 2009
- Grid Classes and the Fibonacci Dichotomy for Restricted PermutationsThe Electronic Journal of Combinatorics, 2006
- On Growth Rates of Closed Permutation ClassesThe Electronic Journal of Combinatorics, 2002