AbstractWe 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
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
Abstract. Does a given a set of polyominoes tile some rectangle? We show that this problem is undeci...
AbstractWe define a convolution operation on the set of polyominoes and use it to obtain a criterion...
We define a convolution operation on the set of polyominoes and use it to obtain a criterion for a g...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
Checkerboard colouring arguments for proving that a given collection of polyominoes cannot tile a fi...
We give a O(n)-time algorithm for determining whether translations of a polyomino with n edges can t...
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
AbstractAs usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given po...
Abstract. The words that tile the plane by translation are characterized by the Beauquier-Nivat cond...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
Abstract. Does a given a set of polyominoes tile some rectangle? We show that this problem is undeci...
AbstractWe define a convolution operation on the set of polyominoes and use it to obtain a criterion...
We define a convolution operation on the set of polyominoes and use it to obtain a criterion for a g...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
Checkerboard colouring arguments for proving that a given collection of polyominoes cannot tile a fi...
We give a O(n)-time algorithm for determining whether translations of a polyomino with n edges can t...
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
AbstractAs usual, a 4-connex finite part of Z2 is called a polyomino. Recognizing whether a given po...
Abstract. The words that tile the plane by translation are characterized by the Beauquier-Nivat cond...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
Abstract. Does a given a set of polyominoes tile some rectangle? We show that this problem is undeci...
DOI
Add to ORKG