The domino problem for hyperbolic groups

By Laurent Bartholdi. 2023

986 citations recorded by the source corpus.

We prove, for every non-virtually free hyperbolic group $G$, that there is no algorithm that, given a finite collection of dominoes, determines whether the Cayley graph of $G$ may be edge-covered by these dominoes so that colours match at vertices. This answers a conjecture by Aubrun, Barbieri and Moutot and goes towards settling a long-standing conjecture of Ballier and Stein.

View Paper: https://www.semanticscholar.org/paper/0bb033ef1e3113f3dd7a01666bcc4ac3b5794c1b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

  1. Denis V. Osin
  2. Daniel T. Wise
  3. Ashot Minasyan
  4. G. Hruska
  5. Ian Agol
  6. Alessandro Sisto
  7. D. Groves
  8. Arthur Bartels

Citations in the corpus