I'm stuck in some algorithms in hyperbolic groups, which may be rather simple. Let $G$ be a hyperbolic group given by a finite presentation. It is known that the hyperbolicity constant $\delta$ can ...
Let $G=BS(m,n)$ denote the Baumslag–Solitar groups defined by the presentation $\langle a,b: b^m a=a b^n\rangle$. We assume that G is non-abelian. Question: Find $m,n$ such that $G$ is an ...
If $G = \langle X | R \rangle$ is a $\delta$-hyperbolic group presentation, then Dehn's algorithm provides a linear time solution to the word problem, but the linear constant is horribly exponential ...