Related papers: The complexity of generalized domino tilings
This note relies heavily on arXiv:1404.6509 and arXiv:1410.7693. Both articles discuss domino tilings of three-dimensional regions, and both are concerned with flips, the local move performed by removing two parallel dominoes and placing…
We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…
We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several…
We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
We define twisted Alexander polynomials of a complex hypersurface with arbitrary singularities. These generalize the classical Alexander polynomials of high dimensional hypersurfaces and the twisted Alexander polynomial of plane curves. We…
The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We…
We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…
In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…
We present a new type of polyominoes that can have transparent squares (holes). We show how these polyominoes can tile rectangles and we categorise them according to their tiling ability. We were able to categorise all but 6 polyominoes…
Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…
We introduce a new family of nonperiodic tilings, based on a substitution rule that generalizes the pinwheel tiling of Conway and Radin. In each tiling the tiles are similar to a single triangular prototile. In a countable number of cases,…
In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…
P. Di Francesco first introduced the "Aztec triangle" in his study of the relationship between the twenty-vertex model and domino tilings. He conjectured an exact formula for the number of tilings of the Aztec triangle, and it has since…
A Jimbo-Miwa like nonlinear differential equation in (3+1)-dimensions is developed through a generalized bilinear equation with the generalized bilinear derivatives. Based on the generalized bilinear forms, two classes of lump solutions,…
We investigate some general machinery for describing semidualizing modules over generic constructions like ladder determinantal rings with coefficients in a normal domain. We also pose and investigate natural localization questions that…
In this paper, we consider the set of all domino tilings of a cubiculated region. The primary question we explore is: How can we move from one tiling to another? Tiling spaces can be viewed as spaces of subgraphs of a fixed graph with a…
We study random domino tilings of a multiply-connected domain with a height function defined on the universal covering space of the domain. We prove a large deviation principle for the height function in two asymptotic regimes. The first…