# Tiling the Line with Triples

Abstract : 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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [2 references]

https://hal.inria.fr/hal-01182962
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 6, 2015 - 10:44:49 AM
Last modification on : Tuesday, March 7, 2017 - 3:00:24 PM
Long-term archiving on: : Friday, May 5, 2017 - 1:27:06 PM

### File

dmAA0119.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01182962, version 1

### Citation

Aaron Meyerowitz. Tiling the Line with Triples. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.257-274. ⟨hal-01182962⟩

Record views