Permutation groups arising from pattern involvement

DOI10.1007/S10801-019-00902-WMaRDI QIDQ6273651arXivWikidataFDO

Authors Erkko Lehtonen

Publication date 18 May 2016

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10801-019-00902-W

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) General theory for finite permutation groups (20B05)

arXiv classification

math.CO

Abstract: For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_{e}ll$, we determine the permutations involving only members of $G$ as $ell$-patterns, i.e., avoiding all patterns in the set $S_{e}llsetminusG$. The set of all $n$-permutations with this property constitutes again a permutation group. We consequently refine and strengthen the classification of sets of permutations closed under pattern involvement and composition that is due to Atkinson and Beals.

This page was built for publication: Permutation groups arising from pattern involvement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6273651)