Related papers: Computation in word-hyperbolic groups

The study of word hyperbolic groups is a prominent topic in geometric group theory; however word hyperbolic groups are defined by a geometric condition which does not extend naturally to semigroups. We propose a linguistic definition.…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…

We characterise hyperbolic groups in terms of quasigeodesics in the Cayley graph forming regular languages. We also obtain a quantitative characterisation of hyperbolicity of geodesic metric spaces by the non-existence of certain local…

We establish three criteria of hyperbolicity of a graph in terms of ``average width of geodesic bigons''. In particular we prove that if the ratio of the Van Kampen area of a geodesic bigon $\beta$ and the length of $\beta$ in the Cayley…

We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

Formal languages based on the multiplication tables of finitely generated groups are investigated and used to give a linguistic characterization of word hyperbolic groups.

A group with a geometric action on some hyperbolic space is necessarily word hyperbolic, but on the other hand every countable group acts (metrically) properly by isometries on a locally finite hyperbolic graph. In this paper we consider…

We consider groups defined by cyclic presentations where the defining word has length three and the cyclic presentation satisfies the T(6) small cancellation condition. We classify when these groups are hyperbolic. When combined with known…

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

We prove the Borel Conjecture for a class of groups containing word-hyperbolic groups and groups acting properly, isometrically and cocompactly on a finite dimensional CAT(0)-space.

A study of triangulations of cycles in the Cayley diagrams of finitely generated groups leads to a new geometric characterization of hyperbolic groups.

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…

We show that a group that is hyperbolic relative to strongly shortcut groups is itself strongly shortcut, thus obtaining new examples of strongly shortcut groups. The proof relies on a result of independent interest: we show that every…

We outline a rigorous algorithm, first suggested by Casson, for determining whether a closed orientable 3-manifold M is hyperbolic, and to compute the hyperbolic structure, if one exists. The algorithm requires that a procedure has been…

We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…

We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.

In this paper we investigate Gromov's question: whether every one-ended word hyperbolic group contains a surface subgroup. The case of double groups is considered by studying the associated one relator groups. We show that the majority…