Simulations and the lamplighter group
DOI10.4171/GGD/692MaRDI QIDQ2694797
Publication date: 4 April 2023
Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.14299
wreath productslamplighter groupDiestel-Leader graphsdomino problemtiling problemdecision problems in group theory
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Geometric group theory (20F65) Undecidability and degrees of sets of sentences (03D35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Symbolic dynamics (37B10)
Related Items
Cites Work
- The large scale geometry of strongly aperiodic subshifts of finite type
- Symbolic dynamics and relatively hyperbolic groups.
- Horocyclic products of trees
- Combinatorial group theory.
- The domino problem on groups of polynomial growth
- Amenability, bi-Lipschitz equivalence, and the von Neumann conjecture
- Lamplighters admit weakly aperiodic SFTs
- Undecidability and nonperiodicity for tilings of the plane
- Burnside's problem, spanning trees and tilings.
- ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
- Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems
- About the Domino Problem for Subshifts on Groups
- Lamplighters, Diestel–Leader Graphs, Random Walks, and Harmonic Functions
- Tiling Problems on Baumslag-Solitar groups
- The undecidability of the domino problem
- A conjecture concerning a limit of non-Cayley graphs
