Related papers: An Integer Linear Programming Model for Tilings
We study optimal decision policies for integer linear programs with a fixed feasible set and varying cost vectors, represented as linear decision trees. Once synthesized for a given feasible set, they return an optimal solution for any…
We overview our recently introduced theory of n-fold integer programming which enables the polynomial time solution of fundamental linear and nonlinear integer programming problems in variable dimension. We demonstrate its power by…
This paper studies the MINLIP estimator for the identification of Wiener systems consisting of a sequence of a linear FIR dynamical model, and a monotonically increasing (or decreasing) static function. Given $T$ observations, this…
In this article we study the problem of recovering the unknown solution of a linear ill-posed problem, via iterative regularization methods. We review the problem of projection-regularization from a statistical point of view. A basic…
This paper describes the celebrated aperiodic hat tiling by Smith et al. [Comb. Theory 8 (2024), 6] as generated by an overlapping iterated function system. We briefly introduce and study infinite sequences of iterated function systems that…
In this paper, we show how a resource allocation problem can be solved through Integer Linear Programming (ILP). A detailed illustrative example is presented, together with an exhaustive overview of the mathematical model. The size of the…
In this paper, we study the many-to-many matching problem on planar point sets with integer coordinates: Given two disjoint sets $R,B \subset [\Delta]^2$ with $|R|+|B|=n$, the goal is to select a set of edges between $R$ and $B$ so that…
An interpolation method for discretising continuous-time Linear Time Invariant (LTI) models is proposed in this paper. It consists first in using the Loewner interpolation framework on a specific set of frequency data and secondly to…
We consider averaged shelling and coordination numbers of aperiodic tilings. Shelling numbers count the vertices on radial shells around a vertex. Coordination numbers, in turn, count the vertices on coordination shells of a vertex, defined…
We consider a problem of multi-product scheduling in production. Each product can be produced by a family of alternative multi-machine technologies. Multi-machine technologies require more than one machine at the same time. A sequence…
Integer Linear Programming with $n$ binary variables and $m$ many $0/1$-constraints can be solved in time $2^{\tilde O(m^2)} \text{poly}(n)$ and it is open whether the dependence on $m$ is optimal. Several seemingly unrelated problems,…
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
Synthetic turbulence models are a useful tool that provide realistic representations of turbulence, necessary to test theoretical results, to serve as background fields in some numerical simulations, and to test analysis tools. Models of 1D…
Recently, inverse problems have attracted more and more attention in computational mathematics and become increasingly important in engineering applications. After the discretization, many of inverse problems are reduced to linear systems.…
We present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm…
A general way to construct chain models with certain Lie algebraic or quantum Lie algebraic symmetries is presented. These symmetric models give rise to series of integrable systems. As an example the chain models with $A_n$ symmetry and…
This work presents a fast direct solver strategy allowing full-wave modeling and dosimetry at terahertz (THz) frequencies. The novel scheme leverages a preconditioned combined field integral equation together with a regularizer for its…
A discrete analogue of the dressing method is presented and used to derive integrable nonlinear evolution equations, including two infinite families of novel continuous and discrete coupled integrable systems of equations of nonlinear…
We revisit the complexity of the classical Interval Scheduling in the dynamic setting. In this problem, the goal is to maintain a set of intervals under insertions and deletions and report the size of the maximum size subset of pairwise…
Coroutine, as a powerful programming construct, is widely used in asynchronous applications to replace thread-based programming or the callback hell. Using coroutines makes code more readable and maintainable, for its ability to transfer…