<div class="csl-entry">Jaroschek, M., Kauers, M., & Kovács, L. (2022). Lonely Points in Simplices. <i>Discrete and Computational Geometry</i>, <i>69</i>, 4–25. https://doi.org/10.1007/s00454-022-00428-2</div>
Given a lattice L⊆Zm and a subset A⊆Rm , we say that a point in A is lonely if it is not equivalent modulo L to another point of A. We are interested in identifying lonely points for specific choices of L when A is a dilated standard simplex, and in conditions on L which ensure that the number of lonely points is unbounded as the simplex dilation goes to infinity.