BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20250330T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260424T141010Z
UID:1743600600@ist.ac.at
DTSTART:20250402T153000
DTEND:20250402T163000
DESCRIPTION:Speaker: Rachel Greenfeld\nhosted by Matthew Kwan and Robert Se
 iringer \nAbstract: Abstract: A set in the Euclidean plane is called an in
 teger distance set if the distance between any pair of its points is an in
 teger.  All so-far-known integer distance sets have all but up to four of
  their points on a single line or circle\; and it had long been suspected\
 , going back to Erds\, that any integer distance set must be of this speci
 al form. In a recent work\, joint with Marina Iliopoulou and Sarah Peluse\
 , we developed a new approach to the problem\, which enabled us to make th
 e first progress towards confirming this suspicion.  In the talk\, I will
  discuss the study of integer distance sets\, its connections with other p
 roblems\, and our new developments.  
LOCATION:Raiffeisen Lecture Hall\, Central Building\, ISTA
ORGANIZER:Stephanie.Dolot@ist.ac.at
SUMMARY:Rachel Greenfeld: Integer distance sets 
URL:https://talks-calendar.ista.ac.at/events/5646
END:VEVENT
END:VCALENDAR