Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
GPT-4o
Gemini 2.5 Pro Pro
o3 Pro
GPT-4.1 Pro
DeepSeek R1 via Azure Pro
2000 character limit reached

Tiling with arbitrary tiles (1505.03697v2)

Published 14 May 2015 in math.CO

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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