Name
Abstract | ||
|---|---|---|
We describe an algorithm that computes the index of a finitely generated subgroup in a finitely L-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in a finitely L-presented group is decidable. As an application, we consider the low-index subgroups of some self-similar groups including the Grigorchuk group, the twisted twin of the Grigorchuk group, the Grigorchuk super-group, and the Hanoi 3-group. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S0218196711006637 | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | Field | DocType |
Coset enumeration, recursive presentations, self-similar groups, Grigorchuk group, low-index subgroups | Grigorchuk group,Stallings theorem about ends of groups,Discrete mathematics,Combinatorics,Finitely-generated abelian group,Locally finite group,Algebra,Coset enumeration,Decidability,Membership problem,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 8 | 0218-1967 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| René Hartung | 1 | 2 | 0.85 |