Márton Naszódi: Computing the Covering Radius with an Application to the Lonely Runner Conjecture
Naszódi MártonBBC+G Seminar
on 10/30/20
We prove that there exist no weak -nets of constant size for lines and convex sets in . This is joint work with Otfried Cheong and Andreas Holmsen