Lonely points in simplices (Q2679594)

A lattice \(L\) is meant to be a subgroup of \((\mathbb{Z}^m,+)\). Let the standard simplex \(S \subseteq \mathbb{R}^m\) be the convex hull of the origin \(0\) and the standard unit vectors \(e_1,\ldots,e_m\), and let \(d > 0\) be a dilation factor. A point \(v \in dS\) is called lonely with respect to \(L\) if \(v \in \mathbb{Z}^m\) and if \(v-w \notin L\) for all \(w \in dS \setminus \{v\}\). The authors present algorithms for detecting all lonely points in \(dS\) and for recognizing if their number is unbounded as \(d\) tends to infinity. Moreover, they give conditions on \(L\) ensuring that the number of lonely points in \(dS\) is unbounded as \(d\) goes to infinity.