The lonely runner conjecture holds for eight runners
Copyright policy )The lonely runner conjecture holds for eight runners
We prove that the lonely runner conjecture holds for eight runners. Our proof relies on a computer verification and on recent results that allow bounding the size of a minimal counterexample. We note that our approach also applies to the known cases with 4, 5, 6, and 7 runners. We expect that minor improvements to our approach could be enough to solve the cases of 9 or 10 runners.
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Combinatorics, Discrete Mathematics, Number Theory, FOS: Mathematics, Combinatorics (math.CO), Number Theory (math.NT)
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Combinatorics, Discrete Mathematics, Number Theory, FOS: Mathematics, Combinatorics (math.CO), Number Theory (math.NT)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!