Summary: In 1906 Axel Thue showed how to construct an infinite non-repetitive (or square-free) word on an alphabet of size 3. Since then this result has been rediscovered many times and extended in many ways. We present a two-dimensional version of this result. We show how to construct a rectangular tiling of the plane using 5 symbols which has the property that lines of tiles which are horizontal, vertical or have slope \(+1\) or \(-1\) contain no repetitions. As part of the construction we introduce a new type of word, one that is non-repetitive up to \(\text{mod }k\), which is of interest in itself. We also indicate how our results might be extended to higher dimensions.
- On avoding \(r\)-repetitions in \(\mathbb R^2\)
- On the minimal alphabet size in multidimensional unrepetitive configurations
- Repetitions in Toeplitz words and the Thue threshold
- On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\)
- Some further results on squarefree arithmetic progressions in infinite words
- On a generalization of Thue sequences
- Forcing nonperiodicity with a single tile
- Words avoiding repetitions in arithmetic progressions
- Avoiding squares over words with lists of size three amongst four symbols
- Non-repetitive strings over alphabet lists
- Avoiding Multiple Repetitions in Euclidean Spaces
- Nonrepetitive sequences
- Pattern avoidance: themes and variations
- Nonrepetitive colorings of graphs
- Nonrepetitive and pattern-free colorings of the plane
- Grasshopper avoidance of patterns
- Grid topologies for the self-organizing map
- Nonrepetitive colorings of graphs -- a survey
- Thue type problems for graphs, points, and numbers
This page was built for publication: Non-repetitive tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1605623)
