paper

Four runners that are barely lonely

arXiv:2610.40694

Abstract

For positive integers let , where is the distance to the nearest integer. Kravitz asked which values below occur. For , Jain and Kravitz showed that the values below are , , up to finitely many undetermined exceptions. We settle the four-runner case completely. A primitive quadruple has if and only if it is, up to order, , or with and , or . The values below are exactly with , , so is the only exception, and Conjecture 4.1 of Fan and Sun holds. A density lemma bounds the length of a quadruple on neither critical subtorus by , and an exact search over 800,816,099 quadruples completes the proof. The same method shows that the two-dimensional subtori of with loneliness below take exactly the three-runner values in that range, which between and are the fractions with . Hence the accumulation points of the four-runner spectrum in are the three-runner values there, as Giri and Kravitz conjectured, and is not the loneliness of a two-dimensional subtorus. For every , assuming the conjecture for and speeds, we prove , which is sharp in , and that every -tuple with and lies on a two-dimensional subtorus of loneliness . This answers a question of Cordella. For five speeds, a two-dimensional subtorus of with loneliness below is the product of a coordinate circle with the circle of or . We also give infinitely many subtori whose maximizers lie off every circle with a repeated speed.

arXiv comment45 pages. Code, data and verification scripts are included as ancillary files