BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Don Stull (University of Chicago)
DTSTART:20241003T180000Z
DTEND:20241003T190000Z
DTSTAMP:20260423T021150Z
UID:OLS/162
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/162/">Re
 cent progress on distance sets in the plane</a>\nby Don Stull (University 
 of Chicago) as part of Online logic seminar\n\n\nAbstract\nRecent work has
  shown that techniques from algorithmic randomness can be used to understa
 nd questions in classical geometric measure theory. One of the central pro
 blems in geometric measure theory is Falconer's distance set conjecture. G
 ive a set E in the plane\, and a point x\, the pinned distance set of E wi
 th respect to x is the set of distances between x and the points in E. In 
 this talk\, I will discuss recent work which uses algorithmic randomness t
 o improve the best known lower bounds for both the Hausdorff and packing d
 imensions of pinned distance sets. This is joint work with Jacob Fiedler.\
 n
LOCATION:https://researchseminars.org/talk/OLS/162/
END:VEVENT
END:VCALENDAR