BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jozsef Solymosi (University of British Columbia)
DTSTART:20210531T140000Z
DTEND:20210531T150000Z
DTSTAMP:20260423T035529Z
UID:EPC/72
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/72/">On 
 Erdős' Unit Distances Problem</a>\nby Jozsef Solymosi (University of Brit
 ish Columbia) as part of Extremal and probabilistic combinatorics webinar\
 n\n\nAbstract\nIn 1946\, Paul Erdős published a paper in the American Mat
 hematical Monthly "On sets of distances of n points". He proposed two prob
 lems in discrete geometry. What is the minimum number of distinct distance
 s among n points in the plane\, and among n points in the plane how many p
 airs of points could be at unit distance from each other? The first questi
 on was answered almost completely by Larry Guth and Netz Katz in 2010\, bu
 t the second\, on unit distances\, resisted all attacks so far. I will tal
 k about the unit distances problems\, and related questions.\n
LOCATION:https://researchseminars.org/talk/EPC/72/
END:VEVENT
END:VCALENDAR