Related papers: The complexity of generalized domino tilings
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond at random according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of…
We study the topology of polynomial functions by deforming them generically. We explain how the non-conservation of the total ``quantity'' of singularity in the neighbourhood of infinity is related to the variation of topology in certain…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…
A projective hypersurface is nodal if it does not have singularities worse than simple nodes. We calculate the rational cohomology of the spaces of equations of nodal cubic and quartic plane curves and also nodal cubic surfaces in the…
The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…
We give a method to determine an explicit solution to a system of two inhomogeneous linear recursive sequences of higher order. Our approach can be used efficiently in solving certain combinatorial problems. We finish the paper by…
We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed…
The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…
We study convex domino towers using a classic dissection technique on polyominoes to find the generating function and an asymptotic approximation.
Properties of partial integrals such as real and complex-valued polynomial, multiple polynomial, exponential, and conditional for ordinary differential systems are studied. The possibilities of constructing first integrals and last…
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…
Let X be a singular affine normal variety with coordinate ring R and assume that there is an R-order admitting a stability structure such that the scheme of relevant semistable representations is smooth, then we construct a partial…
We find the exact formula for the number of distinct $n \times n$ square patterns which appear in a Robinson tiling made of one infinite order supertile.
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
We obtain structural results on translational tilings of periodic functions in $\mathbb{Z}^d$ by finite tiles. In particular, we show that any level one tiling of a periodic set in $\mathbb{Z}^2$ must be weakly periodic (the disjoint union…
It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…