BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Boaz Klartag (Prof.)
DTSTART:20260128T160000Z
DTEND:20260128T170000Z
DTSTAMP:20260412T161840Z
UID:th21/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/th21/1/">Sph
 ere packing</a>\nby Boaz Klartag (Prof.) as part of Theorems of the 21st C
 entury Seminar\n\nLecture held in Online only.\n\nAbstract\nProf. Boaz Kla
 rtag is a world-leading expert in high-dimensional geometry with a long tr
 ack record of solving central open questions in the area. In this talk\, h
 e will present a significant breakthrough in the classical problem of sphe
 re packing.\n\nFor more details\, see the blog announcement of this talk a
 t https://functor.network/user/3333/entry/1591\n\nFor other talks in this 
 series\, visit https://th21.le.ac.uk/next-talks/\n
LOCATION:https://researchseminars.org/talk/th21/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Avi Wigderson (Prof.)
DTSTART:20260211T160000Z
DTEND:20260211T170000Z
DTSTAMP:20260412T161840Z
UID:th21/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/th21/2/">Exp
 ander graphs</a>\nby Avi Wigderson (Prof.) as part of Theorems of the 21st
  Century Seminar\n\nLecture held in Online only.\n\nAbstract\nProf. Avi Wi
 gderson is a world-leading mathematician and computer scientist specializi
 ng in algorithms and complexity theory. His fundamental contributions have
  been recognized with the highest awards\, including the Abel Prize (widel
 y considered the “Nobel Prize of Mathematics”) and the Turing Award (t
 he highest distinction in computer science\, often referred to as the “N
 obel Prize of Computing”). In this talk\, he will discuss expander graph
 s\, their constructions\, and their applications.\n\nFor the information a
 bout other talks in this series\, visit https://th21.le.ac.uk/next-talks/\
 n
LOCATION:https://researchseminars.org/talk/th21/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Assaf Naor (Prof.)
DTSTART:20260304T160000Z
DTEND:20260304T170000Z
DTSTAMP:20260412T161840Z
UID:th21/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/th21/3/">Spa
 rsest cut</a>\nby Assaf Naor (Prof.) as part of Theorems of the 21st Centu
 ry Seminar\n\nLecture held in Online only.\n\nAbstract\nProf. Assaf Naor i
 s a world-leading mathematician known for his groundbreaking contributions
  at the interface of metric geometry\, analysis\, and approximation algori
 thms. His work has earned numerous major distinctions\, including the Nemm
 ers Prize in Mathematics\, the Ostrowski Prize\, and the Bôcher Memorial 
 Prize. In this talk\, he will discuss the Sparsest Cut problem\, explain i
 ts significance in algorithm design\, and present recent algorithm for its
  efficient approximation\, which is a culmination of decades of work.\n
LOCATION:https://researchseminars.org/talk/th21/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Harald Helfgott (Prof.)
DTSTART:20260415T150000Z
DTEND:20260415T160000Z
DTSTAMP:20260412T161840Z
UID:th21/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/th21/4/">Gro
 wth\, expansion and escape in groups</a>\nby Harald Helfgott (Prof.) as pa
 rt of Theorems of the 21st Century Seminar\n\nInteractive livestream: http
 s://teams.microsoft.com/meet/35594396682962?p=uo1lOtTMRZFaO6BjEp\nLecture 
 held in Online only.\n\nAbstract\nProf. Harald Helfgott is a leading mathe
 matician who made fundamental contribution to number theory\, group theory
 \, and additive combinatorics. He is widely known for his proof of the ter
 nary Goldbach conjecture\, as well as for foundational contributions to th
 e study of growth and expansion phenomena in groups. In this talk\, he wil
 l discuss growth and expansion in groups\, including progress toward the c
 elebrated Babai conjecture on the diameters of finite simple groups. See t
 he blog announcement of this talk https://functor.network/user/3333/entr
 y/1724 for more details.\n
LOCATION:https://researchseminars.org/talk/th21/4/
URL:https://teams.microsoft.com/meet/35594396682962?p=uo1lOtTMRZFaO6BjEp
END:VEVENT
END:VCALENDAR