For many groups of finite type, topological finite generation, just-infiniteness and strong completeness are equivalent, and new algorithms classify the groups up to isomorphism on binary and ternary trees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Groups of finite type: classification and structural properties
For many groups of finite type, topological finite generation, just-infiniteness and strong completeness are equivalent, and new algorithms classify the groups up to isomorphism on binary and ternary trees.