BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Davey Fitzpatrick (Princeton University)
DTSTART:20200507T190000Z
DTEND:20200507T200000Z
DTSTAMP:20260404T095424Z
UID:URocCombinatorics/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/URocC
 ombinatorics/1/">Distance problems for planar hypercomplex numbers</a>\nby
  Davey Fitzpatrick (Princeton University) as part of University of Rochest
 er combinatorics seminar\n\nLecture held in Zoom MeetingID797681224.\n\nAb
 stract\nIn this talk\, I will discuss the unit distance and distinct dista
 nces problems over the planar hypercomplex numbers: the dual numbers D and
  the double numbers S. I will show that the distinct distances problem in 
 S^2 behaves similarly to the original problem in R^2. The other three prob
 lems behave rather differently from their real analogs. We can study those
  three problems by introducing various notions of the multiplicity of a po
 int set. The analysis is based on an understanding of the geometry of the 
 dual plane and of the double plane. We will also rely on classical results
  from discrete geometry\, such as the Szemerédi-Trotter theorem.”\n
LOCATION:https://stable.researchseminars.org/talk/URocCombinatorics/1/
END:VEVENT
END:VCALENDAR