2 papers
math.GR2011
Coset enumeration for certain infinitely presented groups
René Hartung
We describe an algorithm that computes the index of a finitely generated subgroup in a finitely -presented group provided that this index is finite. This algorithm shows that th…
math.GR2011
Refined solvable presentations for polycyclic groups
René Hartung, Gunnar Traustason
We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series o…