András Gyárfás: Two Ramsey problems on vertex-ordered complete graphs inspired by twisted drawings
Gyárfás AndrásBBC+G Seminar
on 11/4/22
Abstract: We obtain new upper bounds on the minimal density of lattice coverings of by dilates of a convex body . We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices) that a randomly chosen lattice satisfies . As a step in the proof, we utilize and strengthen results on the discrete Kakeya problem. Joint work with Or Ordentlich and Oded Regev.