The probability that a convex body intersects the integer lattice in a \(k\)-dimensional set (Q664357)

Let \(K\) be a convex body in \(\mathbb{R}^d\). It is known that there is a constant \(C_0\) depending only on \(d\) such that the probability that a random copy \(\rho (K)\) of \(K\) does not intersect \(\mathbb{Z}^d\) is smaller than \(C_0/| K|\), and this is best possible. The author proves that for every \(k<d\) there is a constant \(C\) such that the probability that \(\rho(K)\) contains a subset of dimension \(k\) is smaller than \(C/| K|\). This is best possible if \(k=d-1\). It is conjectured that this is not best possible in the rest of the cases; it is stated that if \(d=2\) and \(k=0\) then one can obtain better bounds. For \(d=2\), the author provides the best possible value of \(C_0\) in the limit case when \(\mathrm{width} (K)\to 0\) and \(| K|\to \infty\).