Tiling the Plane with a Fixed Number of Polyominoes

DOI10.1007/978-3-642-00982-2_54zbMath1233.05087OpenAlexW1509480829MaRDI QIDQ3618618

Nicolas Ollinger

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_54

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Related Items (5)

ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS ⋮ Unnamed Item ⋮ Undecidable translational tilings with only two tiles, or one nonabelian tile ⋮ On the generation of convex polyominoes ⋮ Rectangular tileability and complementary tileability are undecidable

Cites Work

• Unnamed Item
• On translating one polyomino to tile the plane
• Aperiodic tiles
• Decision problems for semi-Thue systems with a few rules
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• Tiling with sets of polyominoes
• An algorithm for deciding if a polyomino tiles the plane
• Tiling with polyominoes
• The undecidability of the domino problem
• A variant of a recursively unsolvable problem

This page was built for publication: Tiling the Plane with a Fixed Number of Polyominoes