BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260408T233911Z
UID:Seminar-MIF-1484@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Othon Michail:MAILTO:Othon.Michail@liverpool.ac.uk
DTSTART:20260317T130000
DTEND:20260317T140000
SUMMARY:MIF Series
DESCRIPTION:Janos Pach: On the distribution of distances: Quo vadis?\n\nIn 1946, Paul Erd?s raised two different problems for the distribution of distances among n points in the plane: (1) What is the minimum number of distinct distances determined by n points in R2? (2) What is the maximum number of times the same distance can occur among n points in R2? The first problem was almost solved by Guth and Katz in 2015 (up to a logarithmic factor). Regarding the second problem, Spencer, Szemerédi, and Trotter proved in 1983 that the maximum is O(n4/3). Over the past 40 years, several new proofs have been found for this bound, but no improvement has been made. After giving a whirlwind survey of the known results and their applications in number theory and computer science, we describe an approach to the second problem, based on graph rigidity. Joint work with O. Raz and J. Solymosi.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1484
LOCATION:
END:VEVENT
END:VCALENDAR