Pierre Alquier (ENSAE) |
Title Abstract. |
---|---|
Dömötör Pálvölgyi (Eötvös Loránd University) |
News about the chromatic number of the plane At least how many colors do we need to color all the points of the plane such that every pair of points at unit distance receive different colors? This question is known as the Hadwiger-Nelson problem and until one year ago it was only known that 4 colors are needed and 7 are enough. Then in April 2018 gerontologist de Grey showed in a breakthrough result that 4 colors are not enough. His proof was computer assisted, and a collaborative Polymath project was started to find a human-verifiable proof. I will give a short introduction to the classical results, then talk about the current ongoing research with plenty of open problems. |
9h30-11h | Pierre Alquier |
---|---|
11h30-12h | Coffee |
12h-13h30 | Dömötör Pálvölgyi |
13h30 | Lunch |
Couprie | Michel | ESIEE / LIGM |
Pluta | Kacper | UPEM |
Jacquin | Pascal | ESIEE |
Meunier | Frédéric | Ecole des Ponts ParisTech |
De Loera | Jesus | University of California |
Dutta | Kunal | INRIA Sophia-Antipolis |
Jartoux | Bruno | LIGM, ESIEE Paris |
Mustafa | Nabil H. | LIGM, ESIEE Paris |
Bárány | Imre | Rényi Institute of Mathematics & UCL |
Romon | Pascal | UPEM |
Barbudo | Elias | ESIEE Paris |
Dias da Fonseca | Guilherme | Université Clermont Auvergne |
Andres | Hervé | Ecole des Ponts ParisTech |
Chu | Chengbin | ESIEE Paris |
De Albuquerque | Arnaldo | UFMG and ESIEE Paris |
Fradelizi | Matthieu | Université Paris-Est Marne-la-Vallée |
Hubard | Alfredo | Université Paris-Est Marne-la-Vallée |