Every Higman-Thompson group V_n (n≥2) is generated by three involutions, improving the known four-involution bound.
Finitely presented simple groups and products of trees
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The Higman--Thompson groups $V_n$ are $(2,2,2)$-generated
Every Higman-Thompson group V_n (n≥2) is generated by three involutions, improving the known four-involution bound.