Printable PDF
Department of Mathematics,
Department of Mathematics,
University of California San Diego
****************************
Math 269 - Combinatorics Seminar
Josh Zahl
University of British Columbia (UBC)
Breaking the 3/2 barrier for unit distances in three dimensions
Abstract:
The unit distance problem asks: given $n$ points in $\mathbb R^d$, how many pairs of points can have distance one? This problem can be re-phrased as a question in incidence geometry, and standard machinery from that field leads to certain non-optimal bounds. I will discuss some recent progress on the unit distance problem in three dimensions that goes beyond the standard tools of incidence geometry.
Host: Andrew Suk
May 15, 2018
4:00 PM
AP&M 7321
****************************
