7
votes
2answers
178 views

Modifying Dehn's algorithm to allow equal length replacements?

I'm an analyst trying to understand a certain class of finitely presented groups (one example is below) so it's quite likely this question is naive but I hope it is at least intelligible. Given a ...
0
votes
0answers
192 views

Finitely presented group and its subgroups

Suppose I have a finitely presented group $G$. By this, I mean I know explicitly what $S$ and $R$ are such that $G = \langle S \mid R \rangle$. Suppose I have a subgroup generated by a finite set of ...
2
votes
1answer
231 views

Presentations of infinite index subgroups

Suppose we have a finitely presented group $G$ with a concrete presentation and a subgroup $H$, generated by a finite set of elements from $G$. How to find the presentation for $H$? If $H$ has finite ...
4
votes
3answers
388 views

Results in the Presentation of Finite Groups

I've been looking at combinatorial group theory, but all the results seem to be about infinite groups. Are there any important results about the presentations finite groups specifically (or are useful ...