Fast Domino Tileability

  title={Fast Domino Tileability},
  author={Igor Pak and Adam Sheffer and Martin Tassy},
  journal={Discrete \& Computational Geometry},
Abstract Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston’s height function approach to a nearly linear time in the perimeter. 
Tiling with Squares and Packing Dominos in Polynomial Time
The standard, compact way to represent a polygon is by listing the coordinates of the corners in binary, and thus the first polynomial time algorithms for the problems are presented, including a simple $O(n\log n) $ algorithm for tiling with squares, and a more involved $O (n^4)$ algorithm for packing and tiled with dominos.
We study and classify proper q-colorings of the Zd lattice, identifying three regimes where different combinatorial behavior holds: (1) When q ≤ d + 1, there exist frozen colorings, that is, proper
A quenched variational principle for discrete random maps
We study the variational principle for discrete height functions (or equivalently domino tilings) where the underlying measure is perturbed by a random field. We show that the variational principle
Mixing properties of colourings of the ℤd lattice
A strong list-colours property is proved which implies that, when $q\ge d+2$ , any proper q-colouring of the boundary of a box of side length $n \ge d-2$ can be extended to a properq-coloured of the entire box.
Kirszbraun-type theorems for graphs
Mixing properties of colorings of the $\mathbb{Z}^d$ lattice
We study and classify proper $q$-colorings of the $\mathbb Z^d$ lattice, identifying three regimes where different combinatorial behavior holds: (1) When $q\le d+1$, there exist frozen colorings,
Borel subsystems and ergodic universality for compact Zd ‐systems via specification and beyond
A Borel Zd dynamical system (X,S) is ‘almost Borel universal’ if any free Borel Zd dynamical system (Y,T) of strictly lower entropy is isomorphic to a Borel subsystem of (X,S) , after removing a null
A variational principle for a non-integrable model
We show the existence of a variational principle for graph homomorphisms from $$\mathbb {Z}^m$$ Z m to a d -regular tree. The technique is based on a discrete Kirszbraun theorem and a concentration
Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings
<jats:p>We prove and generalise a conjecture in [MPP4] about the asymptotics of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=""
Borel subsystems and ergodic universality for compact $\mathbb Z^d$-systems via specification and beyond
A Borel system $(X,S)$ is `almost Borel universal' if any free Borel dynamical system $(Y,T)$ of strictly lower entropy is isomorphic to a Borel subsystem of $(X,S)$, after removing a null set. We


The Complexity of Generalized Domino Tilings
A variety of hardness results are proved (both NP- and #P-completeness) for different generalizations of dominoes in three and higher dimensions.
Hard Tiling Problems with Simple Tiles
This work shows that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs, and shows NP-completeness for the domino and straight tromino for general areas on the cubic lattice, and for simply connected regions on the four-dimensional hypercubic lattice.
Geometric and algebraic properties of polyomino tilings
In this thesis we study tilings of regions on the square grid by polyominoes. A polyomino is any connected shape formed from a union of grid cells, and a tiling of a region is a collection of
Spaces of domino tilings
A criterion to decide if two tilings are in the same connected component, a simple formula for distances, and a method to construct geodesics in this graph, which is a CW-complex whose connected components are homotopically equivalent to points or circles.
Tiling a Polygon with Two Kinds of Rectangles
A quadratic time algorithm is given which, given a polygon F as input, produces a tiling of F with translated copies of the authors' rectangles (or indicates that there is no tiling), and it is proved that any pair oftilings can be linked by a sequence of local transformations of tilings, called flips.
Sublinear Time Algorithms
This work discusses the types of answers that one can hope to achieve in sublinear time algorithms, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input.
Conway's tiling groups
John Conway discovered a technique using infinite, finitely presented groups that in a number of interesting cases resolves the question of whether a region in the plane can be tessellated by given
An n-Dimensional Generalization of the Rhombus Tiling
It is shown that the rhombus tiling can be generalized to n-dimensional tiles for any $n ≥ 3, and it is conjecture that a certain local move is ergodic, and conjecture that it has a mixing time of O(L^{n+2} log L) on regions of size $L$.