Tight instances of the Lonely Runner Conjecture: complete classification of one-entry modifications, a new infinite family, and the growth bound

For a set V of n-1 distinct positive integers write LR(V) = max_t min_{v in V} ||vt||, where ||x|| is the distance from x to the nearest integer; V is tight if LR(V) = 1/n, the value predicted by the Lonely Runner Conjecture. The baseline [n-1] = {1,...,n-1} is tight for every n, and Perarnau and Se