Permutation groups, pattern involvement, and Galois connections

Abstract

There is a connection between permutation groups and permutation patterns: for any subgroup G of the symmetric group S and for any n ≥ , the set of n-permutations involving only members of G as -patterns is a subgroup of Sn. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…