AbstractWe consider the tilings by translation of a single polyomino or tile on the square grid Z2. It is well-known that there are two regular tilings of the plane, namely, parallelogram and hexagonal tilings. Although there exist tiles admitting an arbitrary number of distinct hexagon tilings, it has been conjectured that no polyomino admits more than two distinct parallelogram tilings. In this paper, we prove this conjecture
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
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...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
We give a O(n)-time algorithm for determining whether translations of a polyomino with n edges can t...
AbstractIt has been proved that, among the polyominoes that tile the plane by translation, the so-ca...
It has been proved that, among the polyominoes that tile the plane by translation, the so-called squ...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
We study a problem of a number of lattice plane tilings by given area polyominoes. A polyomino is a ...
AbstractIt has been proved that, among the polyominoes that tile the plane by translation, the so-ca...
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Do...
Abstract. This paper studies properties of tilings of the plane by parallelograms. In particular it ...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...
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...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
We give a O(n)-time algorithm for determining whether translations of a polyomino with n edges can t...
AbstractIt has been proved that, among the polyominoes that tile the plane by translation, the so-ca...
It has been proved that, among the polyominoes that tile the plane by translation, the so-called squ...
AbstractThe definitions and lattice hierarchy previously established for tiling regions with individ...
We study a problem of a number of lattice plane tilings by given area polyominoes. A polyomino is a ...
AbstractIt has been proved that, among the polyominoes that tile the plane by translation, the so-ca...
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Do...
Abstract. This paper studies properties of tilings of the plane by parallelograms. In particular it ...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
The thesis represents a collection of solved problems concerned with covering planar shapes (mostly ...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes...