Totally symmetric sets
Totally symmetric sets in groups were introduced by \textit{K. Kordek} and the second author [Bull. Lond. Math. Soc. 54, No. 1, 95--111 (2022; Zbl 1527.20055)]. A subset \(X\) of a group \(G\) is called totally symmetric if any permutation of \(X\) can be realized by conjugation in \(G\). If \(X \subseteq G\) is a totally symmetric set and \(f: G \rightarrow H\) is a homomorphism, then \(f(X)\) is a totally symmetric set of \(H\). In this paper, the authors demonstrate that a much more stringent condition holds: either \(|f(X)|=|X|\) or \(|f(X)|=1\) (see Lemma 1). In the remainder of the paper, the authors provide a survey of the theory of totally symmetric sets, with applications to symmetric groups, braid groups, and mapping class groups.\N\NFor the entire collection see [Zbl 1560.20003].
- A primer on mapping class groups
- Braid groups and the co-Hopfian property.
- Braids and permutations
- Die Gruppe der Abbildungsklassen. (Das arithmetische Feld auf Flächen.)
- Finite image homomorphisms of the braid group and its generalizations
- Finite index subgroups of mapping class groups
- Finite quotients of braid groups
- From braid groups to mapping class groups
- Fundamental groups of projective discriminant complements
- Homomorphisms between mapping class groups
- Homomorphisms of commutator subgroups of braid groups
- Large totally symmetric sets
- Normal generators for mapping class groups are abundant
- On minimal finite quotients of mapping class groups
- On the smallest non-abelian quotient of (F_n)
- On the smallest non-trivial quotients of mapping class groups
- Smallest noncyclic quotients of braid and mapping class groups
- The Automorphism Groups of the Braid Groups
- Upper bounds for totally symmetric sets
This page was built for publication: Totally symmetric sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7015988)
