2021/07/08 by Gennaro Auricchio, Auricchio, Gennaro, Luca Ferrarini +3
Computer Science · Mathematics · #05B45 #90C10 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:05B45 #msc:90C10
paper · pdf · doi:10.48550/arxiv.2107.04108
16 pages, 2 figures
arxiv created 2021/07/13 · arxiv updated 2021/07/14
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 (T2) 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.