All Questions
Tagged with tiling symbolic-dynamics
11 questions
1
vote
0
answers
47
views
Computing the language of an $S$-adic shift
I have been looking online for how or if one can compute the language of an $S$-adic subshift generated by finitely many substitutions. I know that one can compute the language of a substitution ...
- 633
2
votes
0
answers
116
views
Aperiodic SFT equal to a substitution subshift
I was wondering whether there are primitive symbolic substitutions over $\mathbb{Z}^d$ and alphabet $\mathcal{A}$ whose associated subshift is equal to an aperiodic SFT. By SFT here I mean a subshift ...
- 633
1
vote
1
answer
74
views
Computing admissible patches of a substitution
I have been recently trying to look at substitution tilings with finite local complexity by examining their admissible patch\pattern atlas, which is sometimes called their language. I have also seen ...
- 633
2
votes
1
answer
129
views
Reference on relation between SFTs and Wang-tiles
I've been looking at several papers which allude to a relation between SFTs. Namely, given an SFT $\Omega \subseteq \mathcal{A}^{\mathbb{Z}^2}$ with allowed patches $\mathcal{F}$, we can associate a ...
- 633
1
vote
1
answer
192
views
Topological full groups of subshifts: differences between one-dimensional and multi-dimensional subshifts
For a multidimensional subshift $X$ over $\mathbb Z^d$, the topological full group $[X]$ is the set of homeomorphisms $f$ of $X$ that can be written as $f : x \mapsto \sigma_{c(x)}(x)$ with $c : X \to ...
- 113
1
vote
2
answers
329
views
Sufficient conditions for periodic tiling by Wang tiles
I'm recently interested in whether a sub-shift of finite type contains a doubly-periodic problem, when the set of configurations is of the sort $\mathcal{A}^{\mathbb{Z}^2}$. When $Q_2=\{0,1\}^2$, and ...
- 633
1
vote
1
answer
213
views
Possible weaker version of the Domino/Wang tiling problem
This may be a dumb question, but I was wondering whether the question of 'periodically tiling the plane from a finite set of tiles' is the same as the domino tiling problem or a weaker version. I ...
- 633
1
vote
2
answers
232
views
What does the extension theorem for tilings state?
I have seen several references to the so-called Extension Theorem in the context of tilings of Euclidean space.
E.g. in "The Local Theorem for Monotypic Tilings" one reads
The Extension Theorem [......
- 13.6k
6
votes
2
answers
148
views
Decidability of (restricted) periodicity of Wang tilings
Consider a Wang tiling (given a subset of $C^4$ for a finite set $C$ of colours, e.g.). It's well-known to be undecidable whether there exists a tiling, and also whether there exists a periodic tiling....
- 2,519
10
votes
2
answers
1k
views
Decidability of periodic tilings of the plane
I'm interested in tilings of the plane by squares, with labels on the edges. It's well known that (1) the question "can one tile the plane with the following finite set of tiles?" is undecidable, and (...
- 2,519
1
vote
1
answer
202
views
Overlaying two domino-like constructions such that all individual pairs of domino-like cells in the overlay have matching symbols
Imagine I have two $n$ x $m$ assemblies of $P = (n*m)$ unit square cells on the plane, $(c_{(a,1)}, ..., c_{(a,P)}) \in A$ and $(c_{(b,1)}, ..., c_{(b,P)}) \in B$, where every cell, $c_k$, in a ...
- 13