Tiling with sets of polyominoes

DOI10.1016/S0021-9800(70)80055-2zbMath0319.05019OpenAlexW2023756508WikidataQ56112481 ScholiaQ56112481MaRDI QIDQ4081272

Solomon W. Golomb

Publication date: 1970

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80055-2

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (22)

Polyominoes defined by two vectors ⋮ Irregular polyomino tiling via integer programming with application in phased array antenna design ⋮ Tiling figures of the plane with two bars ⋮ Tiling with arbitrary tiles ⋮ Tiling rectangles with polyominoes ⋮ Tiling rectangles and half strips with congruent polyominoes ⋮ Tiling complexity of small n-ominoes \((N<10)\) ⋮ COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES ⋮ A codicity undecidable problem in the plane. ⋮ Undecidable translational tilings with only two tiles, or one nonabelian tile ⋮ A neural network approach to tiling problems ⋮ Spotlight tiling ⋮ Reconstructing convex polyominoes from horizontal and vertical projections ⋮ Tiling the Plane with a Fixed Number of Polyominoes ⋮ TILING WITH PUNCTURED INTERVALS ⋮ Rectangular tileability and complementary tileability are undecidable ⋮ Polyominoes which tile rectangles ⋮ A characterization of recognizable picture languages by tilings by finite sets ⋮ A new mathematical model for tiling finite regions of the plane with polyominoes ⋮ A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\) ⋮ Homology of polyomino tilings on flat surfaces ⋮ \(q\)-enumeration of convex polyominoes

This page was built for publication: Tiling with sets of polyominoes