Related papers: Decomposition of Integral Self-Affine Multi-Tiles

We combine the two fundamental fixed-order tangle theorems of Robertson and Seymour into a single theorem that implies both, in a best possible way. We show that, for every $k \in \mathbb{N}$, every tree-decomposition of a graph $G$ which…

We consider the problem of reconstructing compositions of an integer from their subcompositions, which was raised by Raykova (albeit disguised as a question about layered permutations). We show that every composition w of n\ge 3k+1 can be…

In the Independent Set Reconfiguration problem under the Token Addition/Removal rule, given a graph $G$ and two independent sets $I$ and $J$ of $G$, we want to transform $I$ into $J$ by adding and removing vertices, such that all the sets…

Irreducible decompositions of monomial ideals in polynomial rings over a field are well-understood. In this paper, we investigate decompositions in the set of monomial ideals in the semigroup ring A[\mathbb{R}_{\geq 0}^d] where A is an…

Let $X$ be a compact K\"ahler fourfold with klt singularities and vanishing first Chern class, smooth in codimension two. We show that $X$ admits a Beauville-Bogomolov decomposition: a finite quasi-\'etale cover of $X$ splits as a product…

A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters A vary in K. The recent algorithms for computing them…

We prove that a complete multipartite graph $K$ with $n>1$ vertices and $m$ edges can be decomposed into edge-disjoint Hamilton paths if and only if $\frac m{n-1}$ is an integer and the maximum degree of $K$ is at most $\frac {2m}{n-1}$.

A challenge of molecular self-assembly is to understand how to design particles that self-assemble into a desired structure and not any of a potentially large number of undesired structures. Here we use simulation to show that a strategy of…

We consider the problem of characterizing finite sets which tile the integers by translations. Coven and Meyerowitz (J. Algebra 1999) found necessary and sufficient conditions for a finite set A to tile the integers under the assumption…

Scientific literature contains large volumes of complex, unstructured figures that are compound in nature (i.e. composed of multiple images, graphs, and drawings). Separation of these compound figures is critical for information retrieval…

The first aim of this work is to characterize when the lattice of all submodules of a module is a direct product of two lattices. In particular, which decompositions of a module $M$ produce these decompositions: the \emph{lattice…

Let S_k be the set of separable states on B(C^m \otimes C^n) admitting a representation as a convex combination of k pure product states, or fewer. If m>1, n> 1, and k \le max(m,n), we show that S_k admits a subset V_k such that V_k is…

Recently, many studies have been devoted to finding diverse solutions in classical combinatorial problems, such as Vertex Cover (Baste et al., IJCAI'20), Matching (Fomin et al., ISAAC'20) and Spanning Tree (Hanaka et al., AAAI'21). We…

Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. These mesoprimary…

Discrete tomography is a well-established method to investigate finite point sets, in particular finite subsets of periodic systems. Here, we start to develop an efficient approach for the treatment of finite subsets of mathematical…

Let $G$ be the Weil restriction of a general linear group. By extending the method of semi-modules developed by de Jong, Oort, Viehmann and Hamacher, we obtain a stratification of the affine Deligne-Lusztig varieties for $G$ (in the affine…

This paper presents a novel and efficient method for characteristic mode decomposition in multi-structure systems. By leveraging the translation and rotation matrices of vector spherical wavefunctions, our approach enables the synthesis of…

The Boij-S\"oderberg characterization decomposes a Betti table into a unique positive integral linear combination of pure diagrams. Given a module with a pure resolution, we describe explicit formulae for computing the decomposition of the…

We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…