Danylo Radchenko (Université de Lille) : "Upper bounds on the chromatic number of Euclidean spaces"

Danylo Radchenko

Université de Lille

Exposé  réel 

 Lieu : Salle Visio, M3

 Résumé : The chromatic number of R^d is the minimal number of colors needed to color the points of R^d in such a way that no two points at distance 1 have the same color. I will first survey some of the results and conjectures about chromatic numbers of Euclidean spaces, and then describe some recent new upper bounds in small dimensions. The talk is based on a joint work with A.Arman, A.Bondarenko, and A.Prymak.