Generating sets consisting of pairwise conjugate elements
From MaRDI portal
Recommendations
Cites work
- Comeagre conjugacy classes and free products with amalgamation
- CONJUGATION IN TREE AUTOMORPHISM GROUPS
- Decomposition of transvections: A theme with variations
- Generating \(\mathrm{Sym}(\omega )\) by permutations preserving dense orders
- Group Actions On R-Trees
- scientific article; zbMATH DE number 3873585 (Why is no real title available?)
- scientific article; zbMATH DE number 1535858 (Why is no real title available?)
- scientific article; zbMATH DE number 3341048 (Why is no real title available?)
- Infinite dimensional general linear groups have finite width.
- Non-nesting actions of Polish groups on real trees.
- On algebraically closed groups
- ON THE BERGMAN PROPERTY FOR THE AUTOMORPHISM GROUPS OF RELATIVELY FREE GROUPS
- Some Constructions for Locally Finite Groups
- The diameter of the commuting graph of a finite group with trivial centre.
- There is no upper bound for the diameter of the commuting graph of a finite group
This page was built for publication: Generating sets consisting of pairwise conjugate elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973340)