In a series of three lectures, we will revisit three well-known examples of distance problems in discrete geometry: the Erdős Unit Distance Problem, the Erdős Distinct Distances Problem, and the Hadwiger-Nelson Problem.
We will cover recent solutions of the analogs of all three problems, and discuss how combinatorial, geometric, and probabilistic methods can be combined with tools from linear algebra, topology, and algebraic geometry to answer related questions. These talks are based primarily on recent joint works with Matija Bucić, Lisa Sauermann, Colin Defant, Noah Kravitz, and Daniel Zhu.
To learn more about the lecture series and this year's speaker, visit the event webpage.
Schedule
December 5, 4:00 p.m.
"Unit distances"
180 Bevier Hall
Reception in Bevier Commons to follow
December 6, 4:00 p.m.
"Distinct distances and equilateral numbers"
4025 Campus Instructional Facility
Refreshments available beginning at 3:30 p.m.
December 7, 4:00 p.m.
"Coloring and ordering"
4025 Campus Instructional Facility
Refreshments available beginning at 3:30 p.m.
