On the density of sets avoiding parallelohedron distance 1 (Q2324626)

It is not known how large can be the upper Lebesgue density of a measurable set in \(\mathbb{R}^n\), which has no two points of the set are at exactly at unit distance apart from each other (unless the dimension is \(n=1\)). The supremum of such upper Lebesgue densities is denoted by \(m_1(\mathbb{R}^n)\). This upper density problem has been motivated by the problem of the measurable chromatic number of \(\chi(\mathbb{R}^n)\), which is the least number of colors needed to color the points of \(\mathbb{R}^n\), such that no two points of the same color are exactly at unit distance apart from each other, as clearly \(\chi(\mathbb{R}^n)\geq \frac{1}{m_1(\mathbb{R}^n})\). The value of \(\mathbb{R}^n\) is not known either. For the origin of these problems, see [\textit{D. G. Larman} and \textit{C. A. Rogers}, Mathematika 19, 1--24 (1972; Zbl 0246.05020); \textit{L. A. Székely}, Combinatorica 4, 213--218 (1984; Zbl 0558.05020)]. Moser, Larman and Rogers conjectured \(m_1(\mathbb{R}^n)<2^{-n}\), extending a conjecture of Erdős made for \(n=2\). These problems have been generalized for any norm \(\|.\|\) on \(\mathbb{R}^n\), into \(m_1(\mathbb{R}^n, \|.\|)\). Bachoc and Robins conjectured that if \(\|.\|\) is a norm on \(\mathbb{R}^n\) such that the unit ball tiles tiles \(\mathbb{R}^n\), then \(m_1(\mathbb{R}^n,\|.\|)=2^{-n}\). The paper under review proves this conjecture for the case \(n=2\) and also solves the problem in \(\mathbb{R}^n\) for special norms that arise from Voronoi regions of lattices.