All Questions
1 question
15
votes
2
answers
2k
views
Dehn's algorithm for word problem for surface groups
For some $g \geq 2$, let $\Gamma_g$ be the fundamental group of a closed genus $g$ surface and let $S_g=\{a_1,b_1,\ldots,a_g,b_g\}$ be the usual generating set for $\Gamma_g$ satisfying the surface ...