Displaying similar documents to “Monoid presentations of groups by finite special string-rewriting systems”

Monoid presentations of groups by finite special string-rewriting systems

Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We show that the class of groups which have monoid presentations by means of finite special [ λ ] -confluent string-rewriting systems strictly contains the class of plain groups (the groups which are free products of a finitely generated free group and finitely many finite groups), and that any group which has an infinite cyclic central subgroup can be presented by such a string-rewriting system if and only if it is the direct product of an infinite cyclic group and a finite cyclic group. ...

Conjugacy pinched and cyclically pinched one-relator groups.

Benjamin Fine, Gerhard Rosenberger, Michael Stille (1997)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

Here we consider two classes of torsion-free one-relator groups which have proved quite amenable to study-the cyclically pinched one-relator groups and the conjugacy pinched one-relator groups. The former is the class of groups which are free products of free groups with cyclic amalgamations while the latter is the class of HNN extensions of free groups with cyclic associated subgroups. Both are generalizations of surface groups. We compare and contrast results in these classes relative...