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.
Automated Reasoning with Theories and Induction for Software Technologies
ERC Consolidator Grant 2020
Mathematical and Algorithmic Foundations: 50% Computer Science Foundations: 50%