Name
Abstract | ||
|---|---|---|
We study the error robustness of tilings of the plane. The fundamental question is the following: given a tileset, what happens if we allow a small probability of errors? Are the objects we obtain close to an error-free tiling of the plane? We prove that tilesets that produce only periodic tilings are robust to errors. For this proof, we use a hierarchical construction of islands of errors (see [6,7]). We also show that another class of tilesets, those that admit countably many tilings is not robust and that there is no computable way to distinguish between these two classes. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-12200-2_42 | LATIN |
Keywords | Field | DocType |
periodic tilings,error robustness,fundamental question,small probability,hierarchical construction,error-free tiling,probability of error | Discrete mathematics,Combinatorics,Substitution tiling,Aperiodic tiling,Computer science,Robustness (computer science),Turing machine,Wang tile,Periodic graph (geometry) | Conference |
Volume | ISSN | ISBN |
6034 | 0302-9743 | 3-642-12199-3 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexis Ballier | 1 | 25 | 4.01 |
| Bruno Durand | 2 | 308 | 40.42 |
| Emmanuel Jeandel | 3 | 123 | 20.06 |