We define a convolution operation on the set of polyominoes and use it to obtain a criterion for a given polyomino not to tile the plane (rotations and translations allowed). We apply the criterion to several families of polyominoes and show that the criterion detects some cases that are not detectable by generalized coloring arguments. (C) 2001 Academic Press
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
We present a new mathematical model for tiling finite subsets of $\mathbb{Z}^2$ using an arbitrary, ...
We give a O(n)-time algorithm for determining whether translations of a polyomino with n edges can t...
AbstractWe define a convolution operation on the set of polyominoes and use it to obtain a criterion...
AbstractWe define a convolution operation on the set of polyominoes and use it to obtain a criterion...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Do...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
AbstractAs usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given po...
It has been proved that, among the polyominoes that tile the plane by translation, the so-called squ...
AbstractIt has been proved that, among the polyominoes that tile the plane by translation, the so-ca...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
AbstractWe consider the tilings by translation of a single polyomino or tile on the square grid Z2. ...
We consider the tilings by translation of a single polyomino or tile on the square grid Z2 (Z exposa...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
We present a new mathematical model for tiling finite subsets of $\mathbb{Z}^2$ using an arbitrary, ...
We give a O(n)-time algorithm for determining whether translations of a polyomino with n edges can t...
AbstractWe define a convolution operation on the set of polyominoes and use it to obtain a criterion...
AbstractWe define a convolution operation on the set of polyominoes and use it to obtain a criterion...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Do...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
AbstractAs usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given po...
It has been proved that, among the polyominoes that tile the plane by translation, the so-called squ...
AbstractIt has been proved that, among the polyominoes that tile the plane by translation, the so-ca...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
AbstractWe consider the tilings by translation of a single polyomino or tile on the square grid Z2. ...
We consider the tilings by translation of a single polyomino or tile on the square grid Z2 (Z exposa...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
We present a new mathematical model for tiling finite subsets of $\mathbb{Z}^2$ using an arbitrary, ...
We give a O(n)-time algorithm for determining whether translations of a polyomino with n edges can t...
DOI
Add to ORKG