# 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 :
Type de document :
Communication dans un congrès
Cori, Robert and Mazoyer, Jacques and Morvan, Michel and Mosseri, Rémy. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), pp.257-274, 2001, DMTCS Proceedings
Domaine :

Littérature citée [2 références]

https://hal.inria.fr/hal-01182962
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 6 août 2015 - 10:44:49
Dernière modification le : mardi 7 mars 2017 - 15:00:24
Document(s) archivé(s) le : vendredi 5 mai 2017 - 13:27:06

### Fichier

dmAA0119.pdf
Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01182962, version 1

### Citation

Aaron Meyerowitz. Tiling the Line with Triples. Cori, Robert and Mazoyer, Jacques and Morvan, Michel and Mosseri, Rémy. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), pp.257-274, 2001, DMTCS Proceedings. 〈hal-01182962〉

### Métriques

Consultations de la notice

## 81

Téléchargements de fichiers