An Integer Linear Programming Model for Tilings
Discrete Mathematics
2021-07-14 v2 Combinatorics
Abstract
In this paper, we propose an Integer Linear Model whose solutions are the aperiodic rhythms tiling with a given rhythm A. We show how this model can be used to efficiently check the necessity of the Coven-Meyerowitz's condition and also to define an iterative algorithm that finds all the possible tilings of the rhythm A. To conclude, we run several experiments to validate the time efficiency of this model.
Cite
@article{arxiv.2107.04108,
title = {An Integer Linear Programming Model for Tilings},
author = {Gennaro Auricchio and Luca Ferrarini and Greta Lanzarotto},
journal= {arXiv preprint arXiv:2107.04108},
year = {2021}
}
Comments
16 pages, 2 figures