Related papers: The domino problem for hyperbolic groups

We introduce an algebraic structure which encodes a collection of countable graphs through a set of states, generators and relations. These structures, which we call blueprints, can capture standard algebraic objects such as groups, monoids…

We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group…

The discreteness problem, that is, the problem of determining whether or not a given finitely generated group G of orientation preserving isometries of hyperbolic three-space is discrete as a subgroup of the whole isometry group of…

We prove that for any countable acylidrically hyperbolic group $G$, there exists a generating set $S$ of $G$ such that the corresponding Cayley graph $\Gamma(G,S)$ is hyperbolic, $|\partial\Gamma(G,X)|>2$, the natural action of $G$ on…

We prove that for a one-ended hyperbolic graph $X$, the size of the quotient $X/G$ by a group $G$ acting freely and cocompactly bounds from below the number of simplices in an Eilenberg-MacLane space for $G$. We apply this theorem to show…

We present an algorithm which decides whether a given quasiconvex residually finite subgroup $H$ of a hyperbolic group $G$ is associated with a splitting. The methods developed also provide algorithms for computing the number of filtered…

We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…

We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups, including toral relatively…

We study the number of ends of a Schreier graph of a hyperbolic group. Let G be a hyperbolic group and let H be a subgroup of G. In general, there is no algorithm to compute the number of ends of a Schreier graph of the pair (G, H).…

Using a probabilistic argument we show that the second bounded cohomology of an acylindrically hyperbolic group $G$ (e.g., a non-elementary hyperbolic or relatively hyperbolic group, non-exceptional mapping class group, ${\rm Out}(F_n)$,…

We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the result of [2].

Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…

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.

We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…

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…

Given isometric actions by a group G on finitely many \delta-hyperbolic metric spaces, we provide a sufficient condition that guarantees the existence of a single element in G that is hyperbolic for each action. As an application we prove a…

We consider splittings of groups over finite and two-ended subgroups. We study the combinatorics of such splittings using generalisations of Whitehead graphs. In the case of hyperbolic groups, we relate this to the topology of the boundary.…

In this note, we explore the notion of hyperbolicity of topologically finitely generated profinite groups. Some applications to diophantine geometry are suggested and we try to reformulate certain problems in diophantine geometry in terms…

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 exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…