Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Tiling $R^{5}$ by Crosses (1206.4436v3)

Published 20 Jun 2012 in cs.IT, math.CO, and math.IT

Abstract: An $n$-dimensional cross comprises $2n+1$ unit cubes: the center cube and reflections in all its faces. It is well known that there is a tiling of $R{n}$ by crosses for all $n.$ AlBdaiwi and the first author proved that if $2n+1$ is not a prime then there are $2{\aleph_{0}}$ \ non-congruent regular (= face-to-face) tilings of $R{n}$ by crosses, while there is a unique tiling of $R{n}$ by crosses for $n=2,3$. They conjectured that this is always the case if $2n+1$ is a prime. To support the conjecture we prove in this paper that also for $R{5}$ there is a unique regular, and no non-regular, tiling by crosses. So there is a unique tiling of $R{3}$ by crosses, there are $2{\aleph_{0}}$ tilings of $R{4},$ but for $R{5}$ there is again only one tiling by crosses. We guess that this result goes against our intuition that suggests "the higher the dimension of the \ space, the more freedom we get".

Citations (4)

Summary

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