Tiling the Line with Triples
It is known the one dimensional prototile $0,a,a+b$ and its reflection $0,b,a+b$ always tile some interval. The subject has not received a great deal of further attention, although many interesting questions exist. All the information about tilings can be encoded in a finite digraph $D_{ab}$. We pre...
Saved in:
| Published in: | Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings vol. AA,...; no. Proceedings; pp. 257 - 274 |
|---|---|
| Main Author: | |
| Format: | Journal Article Conference Proceeding |
| Language: | English |
| Published: |
DMTCS
01.01.2001
Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science |
| Series: | DMTCS Proceedings |
| Subjects: | |
| ISSN: | 1365-8050, 1462-7264, 1365-8050 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | It is known the one dimensional prototile $0,a,a+b$ and its reflection $0,b,a+b$ always tile some interval. The subject has not received a great deal of further attention, although many interesting questions exist. All the information about tilings can be encoded in a finite digraph $D_{ab}$. We present several results about cycles and other structures in this graph. A number of conjectures and open problems are given.In [Go] an elegant proof by contradiction shows that a greedy algorithm will produce an interval tiling. We show that the process of converting to a direct proof leads to much stronger results. |
|---|---|
| ISSN: | 1365-8050 1462-7264 1365-8050 |
| DOI: | 10.46298/dmtcs.2282 |