Tiling the Line with Triples - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2001

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 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.
Fichier principal
Vignette du fichier
dmAA0119.pdf (167.89 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01182962 , version 1 (06-08-2015)



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


44 View
551 Download



Gmail Facebook Twitter LinkedIn More