Generating sets consisting of pairwise conjugate elements
From MaRDI portal
Publication:2973340
DOI10.1142/S0218196717500047zbMath1394.20019OpenAlexW2579753648MaRDI QIDQ2973340
Publication date: 3 April 2017
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196717500047
Conjugacy classes for groups (20E45) Generators, relations, and presentations of groups (20F05) Groups acting on trees (20E08) Infinite automorphism groups (20B27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating \(\mathrm{Sym}(\omega )\) by permutations preserving dense orders
- Non-nesting actions of Polish groups on real trees.
- Comeagre conjugacy classes and free products with amalgamation
- Decomposition of transvections: A theme with variations
- There is no upper bound for the diameter of the commuting graph of a finite group
- The diameter of the commuting graph of a finite group with trivial centre.
- On algebraically closed groups
- Some Constructions for Locally Finite Groups
- Group Actions On R-Trees
- CONJUGATION IN TREE AUTOMORPHISM GROUPS
- ON THE BERGMAN PROPERTY FOR THE AUTOMORPHISM GROUPS OF RELATIVELY FREE GROUPS
This page was built for publication: Generating sets consisting of pairwise conjugate elements