Tiling with arbitrary tiles

DOI10.1112/plms/pdw017zbMath1347.05027arXiv1505.03697OpenAlexW2964333087MaRDI QIDQ3186407

Imre Leader, Ta Sheng Tan, Vytautas Gruslys

Publication date: 9 August 2016

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.03697

zbMATH Keywords

Chalcraft's conjecture

Mathematics Subject Classification ID

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

Related Items (9)

Partitioning the Boolean lattice into copies of a poset ⋮ Partitioning the vertices of a torus into isomorphic subgraphs ⋮ PUNCTURED INTERVALS TILE Z3 ⋮ Tiling the Boolean lattice with copies of a poset ⋮ Undecidable translational tilings with only two tiles, or one nonabelian tile ⋮ Almost tiling of the Boolean lattice with copies of a poset ⋮ Packing the Boolean lattice with copies of a poset ⋮ TILING WITH PUNCTURED INTERVALS ⋮ A new mathematical model for tiling finite regions of the plane with polyominoes

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Polyominoes which tile rectangles
• Tiling with polyominoes and combinatorial group theory
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• Tiling with sets of polyominoes
• Tiling with polyominoes
• Packing a rectangle with congruent N-ominoes
• The undecidability of the domino problem

This page was built for publication: Tiling with arbitrary tiles