Related papers: Geometry of the word problem for 3-manifold groups

We provide a solution to the isomorphism problem for torsion-free relatively hyperbolic groups with abelian parabolics. As special cases we recover solutions to the isomorphism problem for: (i) torsion-free hyperbolic groups (Sela); and…

Given a 2-manifold, a fundamental question to ask is which groups can be realized as the isometry group of a Riemannan metric of constant curvature on the manifold. In this paper, we give a nearly complete classification of such groups for…

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…

We survey the status of some decision problems for 3-manifolds and their fundamental groups. This includes the classical decision problems for finitely presented groups (Word Problem, Conjugacy Problem, Isomorphism Problem), and also the…

We prove a finiteness theorem for subgroups of bounded rank in hyperbolic $3$-manifold groups. As a consequence, we show that every bounded rank covering tower of closed hyperbolic $3$-manifolds is a tower of finite covers associated to a…

Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.

We show that every word hyperbolic, surface-by-(noncyclic) free group Gamma is as rigid as possible: the quasi-isometry group of Gamma equals the abstract commensurator group Comm(Gamma), which in turn contains Gamma as a finite index…

J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead…

We prove that the word problem for the infinite cyclic group is not EDT0L, and obtain as a corollary that a finitely generated group with EDT0L word problem must be torsion. In addition, we show that the property of having an EDT0L word…

We prove that fundamental groups of orientable (geometrizable) 3-manifolds have a solvable conjugacy problem.

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

We prove that the profinite completion of the fundamental group of a compact 3-manifold $M$ satisfies a Tits alternative: if a closed subgroup $H$ does not contain a free pro-$p$ subgroup for any $p$, then $H$ is virtually soluble, and…

With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…

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…

Any action of a group $\Gamma$ on $\mathbb H^3$ by isometries yields a class in degree three bounded cohomology by pulling back the volume cocycle to $\Gamma$. We prove that the bounded cohomology of finitely generated Kleinian groups…

We show that the class of groups with $k$-multiple context-free word problem is closed under graphs of groups with finite edge groups.

We introduce a new class of possibly noncompact n-dimensional manifolds without boundary associated to finite data which we call topological automata. This class is large enough to contain many interesting examples of open 2-dimensional and…

We show that for a representation of the fundamental group of a triangulated closed 3-manifold (not necessarily hyperbolic) into $\PSL$ so that any edge loop has non-trivial image under the representation, there exist uncountably many…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…