Tiling with sets of polyominoes
From MaRDI portal
Cited in
(28)- Tiling complexity of small n-ominoes \((N<10)\)
- A characterization of recognizable picture languages by tilings by finite sets
- A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\)
- \(q\)-enumeration of convex polyominoes
- Polyominoes defined by two vectors
- Tiling figures of the plane with two bars
- Tiling rectangles with polyominoes
- Tiling rectangles and half strips with congruent polyominoes
- A codicity undecidable problem in the plane.
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- Tiling with arbitrary tiles
- A new mathematical model for tiling finite regions of the plane with polyominoes
- Tiling the Plane with a Fixed Number of Polyominoes
- A neural network approach to tiling problems
- Tiling with punctured intervals
- COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
- Homology of polyomino tilings on flat surfaces
- Undecidable translational tilings with only two tiles, or one nonabelian tile
- Spotlight tiling
- Reconstructing convex polyominoes from horizontal and vertical projections
- Undecidability of tiling the plane with a set of 5 polyominoes
- A note on reduction of tiling problems
- Undecidability of translational tiling of the 3-dimensional space with a set of 6 polycubes
- A counterexample to the periodic tiling conjecture
- Translational tiling with 8 polyominoes is undecidable
- Tiling with three polygons is undecidable
- Rectangular tileability and complementary tileability are undecidable
- Polyominoes which tile rectangles
This page was built for publication: Tiling with sets of polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4081272)
