Pages that link to "Item:Q3618618"
From MaRDI portal
The following pages link to Tiling the Plane with a Fixed Number of Polyominoes (Q3618618):
Displaying 23 items.
- Two infinite families of polyominoes that tile the plane by translation in two distinct ways (Q638553) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- An undecidable problem about rational sets and contour words of polyominoes (Q751298) (← links)
- The 4-way deterministic tiling problem is undecidable (Q1013128) (← links)
- On translating one polyomino to tile the plane (Q1179128) (← links)
- Tiling a square with eight congruent polyominoes (Q1268613) (← links)
- Tiling allowing rotations only (Q1292299) (← links)
- Isohedral polyomino tiling of the plane (Q1293680) (← links)
- On the solvability of domino snake problems (Q1331945) (← links)
- Some open problems in polyomino tilings (Q1622945) (← links)
- Planar tilings by polyominoes, polyhexes, and polyiamonds (Q1765444) (← links)
- On the generation of convex polyominoes (Q2255820) (← links)
- A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino (Q3132886) (← links)
- A new mathematical model for tiling finite regions of the plane with polyominoes (Q3303533) (← links)
- Optimal Partial Tiling of Manhattan Polyominoes (Q3648774) (← links)
- (Q4571826) (← links)
- (Q4988159) (← links)
- ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS (Q5075065) (← links)
- Periodicity and decidability of tilings of ℤ2 (Q5218129) (← links)
- Polyomino convolutions and tiling problems (Q5947369) (← links)
- Undecidable translational tilings with only two tiles, or one nonabelian tile (Q6142360) (← links)
- Tiling the plane with a set of ten polyominoes (Q6552512) (← links)
- An aperiodic monotile (Q6615494) (← links)
