Aaron Meyerowitz - Tiling the Line with Triples

dmtcs:2282 - Discrete Mathematics & Theoretical Computer Science, January 1, 2001, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001) - https://doi.org/10.46298/dmtcs.2282
Tiling the Line with Triples

Authors: Aaron Meyerowitz

    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.


    Volume: DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
    Section: Proceedings
    Published on: January 1, 2001
    Imported on: November 21, 2016
    Keywords: Tiling,one dimension,direct proof,[INFO] Computer Science [cs],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

    Share

    Consultation statistics

    This page has been seen 139 times.
    This article's PDF has been downloaded 96 times.