Kleinian groups and the rank problem
classification
🧮 math.GT
math.GR
keywords
classgroupskleinianproblemrankcardinalityclassesdecidable
read the original abstract
We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given cardinality.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.