Large totally symmetric sets

MaRDI QIDQ6179155zbMATH OpenFDO

Authors Noah Caplinger

Publication date 5 September 2023

Published in The New York Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2208.09050, http://nyjm.albany.edu/j/2023/29-36.html

zbMATH Keywords

automorphismsymmetric grouptotally symmetric set

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Symmetric groups (20B30)

Abstract: A totally symmetric set is a subset of a group such that every permutation of the subset can be realized by conjugation in the group. The (non-)existence of large totally symmetric sets obstruct homomorphisms, so bounds on the sizes of totally symmetric sets are of particular use. In this paper, we prove that if a group has a totally symmetric set of size $k$, it must have order at least $(k+1)!$. We also show that with three exceptions, $(1;i)midi=2,ldots,nsubset{S}_n$ is the only totally symmetric set making this bound sharp; it is thus the largest totally symmetric set relative to the size of the ambient group.

Recommendations

• Monotypical uniformly homogeneous sets of permutations
• Totally symmetric colored graphs
• On t-homogeneous permutation sets
• Subgroups of infinite symmetric groups which are full for large sets
• Large minimal invariable generating sets in the finite symmetric groups

Cites work

• Finite image homomorphisms of the braid group and its generalizations
• From braid groups to mapping class groups
• Representation stability in the level 4 braid group
• The maximal subgroups of the symmetric group
• Upper bounds for totally symmetric sets

Cited in

(4)

• Jordan-Hölder theorem for pseudo-symmetric sets
• Sets with large additive energy and symmetric sets
• Upper bounds for totally symmetric sets
• Totally symmetric sets

This page was built for publication: Large totally symmetric sets

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