Dense forests and Danzer sets

A set $Y\subseteq\mathbb{R}^d$ that intersects every convex set of volume $1$ is called a Danzer set. It is not known whether there are Danzer sets in $\mathbb{R}^d$ with growth rate $O(T^d)$. We prove that natural candidates, such as discrete sets that arise from substitutions and from cut-and-project constructions, are not Danzer sets. For cut and project sets our proof relies on the dynamics of homogeneous flows. We consider a weakening of the Danzer problem, the existence of uniformly discrete dense forests, and we use homogeneous dynamics (in particular Ratner's theorems on unipotent flows) to construct such sets. We also prove an equivalence between the above problem and a well-known combinatorial problem, and deduce the existence of Danzer sets with growth rate $O(T^d\log T)$, improving the previous bound of $O(T^d\log^{d-1} T)$

A Danzer set for Axis Parallel Boxes

We present concrete constructions of discrete sets in $\mathbb{R}^d$ ($d\ge 2$) that intersect every aligned box of volume $1$ in $\mathbb{R}^d$, and which have optimal growth rate $O(T^d)$