Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tiling with arbitrary tiles

Published 14 May 2015 in math.CO | (1505.03697v2)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.