2011/06/01 by René Hartung, Hartung, René
Mathematics · #FOS: Mathematics #Group Theory (math.GR) #math.GR
paper · pdf · doi:10.48550/arxiv.1106.0259
arxiv created 2011/06/01 · arxiv updated 2011/06/02
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