AbstractThis paper considers the possibility of tiling regions using dominoes. Multiply-connected planar regions consisting of unit squares are studied. These regions include subsets of the checkerboard, but other variants are also discussed. It presents more generalized discussions than Thurston's necessary and sufficient condition given for the simply-connected regions
AbstractWe prove that the word problem for the group of dominoes is equivalent to the existence of a...
Imagine you have a cutout from a piece of squared paper and a pile of dominoes, each of which can co...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
AbstractThis paper considers the possibility of tiling surfaces using dominoes. Orientable surfaces ...
AbstractThis paper considers the possibility of tiling surfaces using dominoes. Orientable surfaces ...
In this paper a way of representing an ordinary partition as a tiling with dominoes and squares is i...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
In this paper, we consider domino tilings of regions of the formD×[0, n], where D is a simply connec...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (dom...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
Abstract. This paper reports a work in progress whose aim is to develop a computational framework to...
We investigate tilings of cubiculated regions with two simply connected floors by 2×1×1 bricks. More...
The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generali...
AbstractWe prove that the word problem for the group of dominoes is equivalent to the existence of a...
Imagine you have a cutout from a piece of squared paper and a pile of dominoes, each of which can co...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
AbstractThis paper considers the possibility of tiling surfaces using dominoes. Orientable surfaces ...
AbstractThis paper considers the possibility of tiling surfaces using dominoes. Orientable surfaces ...
In this paper a way of representing an ordinary partition as a tiling with dominoes and squares is i...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
In this paper, we consider domino tilings of regions of the formD×[0, n], where D is a simply connec...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (dom...
Abstract. Tiling planar regions with dominoes is a classical problem in which the decision and count...
Abstract. This paper reports a work in progress whose aim is to develop a computational framework to...
We investigate tilings of cubiculated regions with two simply connected floors by 2×1×1 bricks. More...
The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generali...
AbstractWe prove that the word problem for the group of dominoes is equivalent to the existence of a...
Imagine you have a cutout from a piece of squared paper and a pile of dominoes, each of which can co...
International audienceThe Undecidability of the Domino ProblemEmmanuel Jeandel and Pascal VanierOne ...
DOI
Add to ORKG