arXiv:1605.04516 [math.CO]AbstractReferencesReviewsResources
Permutation groups, pattern involvement, and Galois connections
Erkko Lehtonen, Reinhard Pöschel
Published 2016-05-15Version 1
There is a connection between permutation groups and permutation patterns: for any subgroup $G$ of the symmetric group $S_\ell$ and for any $n \geq \ell$, the set of $n$-permutations involving only members of $G$ as $\ell$-patterns is a subgroup of $S_n$. Making use of the monotone Galois connection induced by the pattern avoidance relation, we characterize the permutation groups that arise via pattern avoidance as automorphism groups of relations of a certain special form. We also investigate a related monotone Galois connection for permutation groups and describe its closed sets and kernels as automorphism groups of relations.
Comments: 23 pages, 1 figure
Related articles: Most relevant | Search more
Permutation polytopes and indecomposable elements in permutation groups
Automorphism groups of cyclic codes
arXiv:math/0411302 [math.CO] (Published 2004-11-13)
Automorphism groups of circulant graphs -- a survey