activity
20072012
most citedA nilpotent quotient algorithm for L-presented groups

10 citations · 16 across the 7 of their papers we have counts for

collaborators

8 papers

math.GR2012

A Note on Invariantly Finitely -Presented Groups

René Hartung

In the first part of this note, we introduce Tietze transformations for -presentations. These transformations enable us to generalize Tietze's theorem for finitely presented gro…

math.GR2012

Investigating self-similar groups using their finite -presentation

René Hartung

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Variou…

math.GR2011

A Reidemeister-Schreier theorem for finitely -presented groups

René Hartung

We prove a variant of the well-known Reidemeister-Schreier theorem for finitely -presented groups. More precisely, we prove that each finite index subgroup of a finitely -pre…

math.GR2011★ 6 cited

Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients

René Hartung

We describe an algorithm for computing successive quotients of the Schur multiplier for a group given by an invariant finite -presentation. As application, we investi…

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…