Permutation groups arising from pattern involvement

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

For an arbitrary finite permutation group G, subgroup of the symmetric group S, we determine the permutations involving only members of G as ℓ-patterns, i.e. avoiding all patterns in the set S\ G. 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.

Original languageBritish English
Pages (from-to)251-298
Number of pages48
JournalJournal of Algebraic Combinatorics
Volume52
Issue number3
DOIs
StatePublished - 1 Nov 2020

Keywords

  • Galois connection
  • Imprimitive group
  • Intransitive group
  • Permutation group
  • Permutation pattern
  • Primitive group

Fingerprint

Dive into the research topics of 'Permutation groups arising from pattern involvement'. Together they form a unique fingerprint.

Cite this