The Steinhaus tiling problem and the range of certain quadratic forms
classification
🧮 math.CA
math.MGmath.NT
keywords
dimensionproblemsteinhausalwayscertaincontaineuclideanexactly
read the original abstract
We give a short proof of the fact that there are no measurable subsets of Euclidean space (in dimension d > 2), which, no matter how translated and rotated, always contain exactly one integer lattice point. In dimension d=2 (the original Steinhaus problem) the question remains open.
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.