Characterize all tight instances of the Lonely Runner Conjecture

Classify all sets of n positive integer speeds V for which the loneliness gap attains equality, i.e., κ(V) = 1/(n+1), modulo dilation. Identify necessary and sufficient arithmetic conditions describing precisely which speed sets are tight.

Background

Tight instances are sets of speeds for which the conjectured bound is met exactly. Beyond dilations of [n], several sporadic and infinite families are known via specific arithmetic constructions (e.g., accelerating selected runners).

Despite progress, a general characterization remains elusive and is linked to deep number-theoretic problems such as Jacobsthal’s problem.