10 citations · 16 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…