Tiling the Line with Triples - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2001

Tiling the Line with Triples

Résumé

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
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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⟩

Collections

TDS-MACS
50 Consultations
691 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More