pith. machine review for the scientific record. sign in

arxiv: 1505.03697 · v2 · submitted 2015-05-14 · 🧮 math.CO

Recognition: unknown

Tiling with arbitrary tiles

Authors on Pith no claims yet
classification 🧮 math.CO
keywords mathbbtilearbitrarychalcraftconjecturecopiesfinitehaving
0
0 comments X
read the original abstract

Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$ for some $d$. This resolves a conjecture of Chalcraft.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.