2017
DOI: 10.4171/ggd/421
|View full text |Cite
|
Sign up to set email alerts
|

Strongly aperiodic subshifts on surface groups

Abstract: This paper is devoted to proving the following theorem.Theorem. A hyperbolic group admits a strongly aperiodic subshift of finite type if and only if it has at most one end.We introduce the subject in Section 1 and give an informal outline in Section 2. In Section 3, we formally define our terms and set up the proof, which is a combination of the results of Sections 3-9 as follows:Proof of the Theorem. Propositions 8. 5, 8.12, and 9.5 show that any one-ended hyperbolic group G admits a non-empty subshift of f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
19
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(21 citation statements)
references
References 26 publications
2
19
0
Order By: Relevance
“…Compare this with the other results for several one-ended groups which admit a subshift of finite type on which the group acts freely (see e.g. the classical result for Z 2 in [4] and many other more recent developments in [20], [32], [19]).…”
Section: Introductionsupporting
confidence: 61%
“…Compare this with the other results for several one-ended groups which admit a subshift of finite type on which the group acts freely (see e.g. the classical result for Z 2 in [4] and many other more recent developments in [20], [32], [19]).…”
Section: Introductionsupporting
confidence: 61%
“…Our weakly but not strongly aperiodic SFT will work by encoding specific substitutions into BS (1, n). Indeed, the Cayley graph of BS(1, n) is very similar to orbit graphs of constant-size substitutions (see for example [2,9] for a definition of orbit graphs and another example of a Cayley graph similar to an orbit graph). In this section, we start by creating artificially a set of substitutions that are easy to encode in BS(1, n) (Section 3.1), and show how to do it (Section 3.2).…”
Section: A Weakly But Not Strongly Aperiodic Sft On Bs(1 N)mentioning
confidence: 99%
“…Inspired by [7], we associate a tiling of R 2 with the orbit of an infinite word w ∈ A Z under the action of a substitution, in which every tile codes a production rule of the substitution.…”
Section: Substitutions Orbits and Tilingsmentioning
confidence: 99%
“…This class of structures includes the hyperbolic plane model of [13], which can be though of as an orbit graph of the one-letter substitution 0 → 00. Using an idea involving superposition of orbit graphs of substitutions, presented in [7] and whose idea they attribute to Lorenzo Sadun, we show that the domino problem is undecidable on all orbit graphs of non-deterministic substitutions that satisfy a technical property (Section 4).…”
Section: Introductionmentioning
confidence: 99%