Kravitz’s four-runner loneliness-spectrum question and Fan–Sun Conjecture 4.1
For positive integers with , define , where denotes the distance from to the nearest integer. Determine all values of that are less than . The claimed classification is that these values are exactly ; equivalently, the values are for except for , together with the exceptional value .
References
- Four runners that are barely lonely — arXiv — Hyunjun Yi, Karam Gill, Bryan Bu
Source: arXiv
Progress summary
An October 2026 preprint claims a complete classification for the four-runner spectrum, but the result has not been independently checked.
Kravitz’s spectrum conjecture predicts restricted loneliness values for runners; Fan and Sun showed the original prediction fails for four runners and proposed Conjecture 4.1 as an amendment.
Known results
- Fan and Sun (published February 27, 2026): four-runner counterexamples to Kravitz’s original conjecture, including .
- Fan and Sun (2026): Conjecture 4.1 asserts values for , or at least ; it was proved only in a stated common-factor case.
October 2026 classification claim
Hyunjun Yi, Karam Gill, and Bryan Bu claim that primitive quadruples with loneliness below have values for , except for the unique value , supported by a large exact computational search and further structural results. This unrefereed preprint has not been independently assessed.
Current status (as of November 2026): The original four-runner spectrum conjecture is refuted, while the claimed complete classification resolving the remaining four-runner question is unverified.
Sources
Solutions 0
No solutions have been posted yet.