An Integer Linear Programming Model for Tilings

07/08/2021
by   Gennaro Auricchio, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2023

Orbit-finite linear programming

An infinite set is orbit-finite if, up to permutations of the underlying...
research
01/30/2019

Generic Connectivity-Based CGRA Mapping via Integer Linear Programming

Coarse-grained reconfigurable architectures (CGRAs) are programmable log...
research
06/26/2023

Integer Linear Programming Modeling of Addition Sequences With Additional Constraints for Evaluation of Power Terms

In this work, an integer linear programming (ILP) based model is propose...
research
05/19/2020

Integer Linear Programming for the Tutor Allocation Problem: A Practical Case in a British University

In the Tutor Allocation Problem, the objective is to assign a set of tut...
research
06/21/2022

Robustness against data loss with Algebraic Statistics

The paper describes an algorithm that, given an initial design ℱ_n of si...
research
12/22/2017

A simple introduction to Karmarkar's Algorithm for Linear Programming

An extremely simple, description of Karmarkar's algorithm with very few ...
research
11/06/2022

Approximate Graph Colouring and the Hollow Shadow

We show that approximate graph colouring is not solved by constantly man...

Please sign up or login with your details

Forgot password? Click here to reset