Algorithms and classification in combinatorial group theory
Springer-Verlag, 1992 - Mathematics - 232 pages
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
2-complex abelian group Algebra asynchronously automatic automatic groups basis Baumslag CEHPT collapsible complete rewriting system complex compute conjugacy problem conjugate construct cyclic decision problems defining relations Dehn function Dehn's algorithm denote elements embedded essential cell example expansion finite group finitely generated free finitely presented group finitely presented infinite finitely presented simple Fn,r free abelian group free group Gersten given Gn,r group G group theory hence Higman homology homomorphism homotopy hyperbolic groups infinite simple groups integer irreducible words isomorphism isomorphism problem isoperimetric inequality Kampen diagram Lemma Let G Markov property Math monoid n-cells negatively curved groups Neumann non-trivial normal forms obtained one-relator groups partition presented infinite simple presented simple group proof proved Qn,r quotient recursively enumerable redundant cell result rewriting rule satisfies sequence simple group simplicial small cancellation solvable groups solvable word problem subword Suppose symbol Theorem Tn,r triangle unsolvable word problem variety vertex