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.

翻译：在本文中,我们提出一个整数线性模型,其解决办法是用给定节奏A进行定期节奏平铺。我们展示了如何利用这一模型有效检查Coven-Myerowitz$(T2)条件的必要性,并界定一种迭代算法,找到所有可能的节奏A。最后,我们进行了数项实验,以验证这一模型的时间效率。