2000 character limit reached
On the Non-existence of Lattice Tilings by Quasi-crosses
Published 4 Nov 2012 in cs.IT, math.CO, and math.IT | (1211.0658v1)
Abstract: We study necessary conditions for the existence of lattice tilings of $\Rn$ by quasi-crosses. We prove non-existence results, and focus in particular on the two smallest unclassified shapes, the $(3,1,n)$-quasi-cross and the $(3,2,n)$-quasi-cross. We show that for dimensions $n\leq 250$, apart from the known constructions, there are no lattice tilings of $\Rn$ by $(3,1,n)$-quasi-crosses except for ten remaining cases, and no lattice tilings of $\Rn$ by $(3,2,n)$-quasi-crosses except for eleven remaining cases.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.