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:20260424T221318Z
UID:th21/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/th21/
 1/">Sphere packing</a>\nby Boaz Klartag (Prof.) as part of Theorems of the
  21st Century Seminar\n\nLecture held in Online only.\n\nAbstract\nProf. B
 oaz Klartag is a world-leading expert in high-dimensional geometry with a 
 long track record of solving central open questions in the area. In this t
 alk\, he will present a significant breakthrough in the classical problem 
 of sphere packing.\n\nFor more details\, see the blog announcement of this
  talk at https://functor.network/user/3333/entry/1591\n\nFor other talks i
 n this series\, visit https://th21.le.ac.uk/next-talks/\n
LOCATION:https://stable.researchseminars.org/talk/th21/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Avi Wigderson (Prof.)
DTSTART:20260211T160000Z
DTEND:20260211T170000Z
DTSTAMP:20260424T221318Z
UID:th21/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/th21/
 2/">Expander graphs</a>\nby Avi Wigderson (Prof.) as part of Theorems of t
 he 21st Century Seminar\n\nLecture held in Online only.\n\nAbstract\nProf.
  Avi Wigderson is a world-leading mathematician and computer scientist spe
 cializing in algorithms and complexity theory. His fundamental contributio
 ns have been recognized with the highest awards\, including the Abel Prize
  (widely considered the “Nobel Prize of Mathematics”) and the Turing A
 ward (the highest distinction in computer science\, often referred to as t
 he “Nobel Prize of Computing”). In this talk\, he will discuss expande
 r graphs\, their constructions\, and their applications.\n\nFor the inform
 ation about other talks in this series\, visit https://th21.le.ac.uk/next-
 talks/\n
LOCATION:https://stable.researchseminars.org/talk/th21/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Assaf Naor (Prof.)
DTSTART:20260304T160000Z
DTEND:20260304T170000Z
DTSTAMP:20260424T221318Z
UID:th21/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/th21/
 3/">Sparsest cut</a>\nby Assaf Naor (Prof.) as part of Theorems of the 21s
 t Century Seminar\n\nLecture held in Online only.\n\nAbstract\nProf. Assaf
  Naor is a world-leading mathematician known for his groundbreaking contri
 butions at the interface of metric geometry\, analysis\, and approximation
  algorithms. His work has earned numerous major distinctions\, including t
 he Nemmers Prize in Mathematics\, the Ostrowski Prize\, and the Bôcher Me
 morial Prize. In this talk\, he will discuss the Sparsest Cut problem\, ex
 plain its significance in algorithm design\, and present recent algorithm 
 for its efficient approximation\, which is a culmination of decades of wor
 k.\n
LOCATION:https://stable.researchseminars.org/talk/th21/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Harald Helfgott (Prof.)
DTSTART:20260415T150000Z
DTEND:20260415T160000Z
DTSTAMP:20260424T221318Z
UID:th21/4
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/th21/
 4/">Growth\, expansion and escape in groups</a>\nby Harald Helfgott (Prof.
 ) as part of Theorems of the 21st Century Seminar\n\nLecture held in Onlin
 e only.\n\nAbstract\nProf. Harald Helfgott is a leading mathematician who 
 made fundamental contribution to number theory\, group theory\, and additi
 ve combinatorics. He is widely known for his proof of the ternary Goldbach
  conjecture\, as well as for foundational contributions to the study of gr
 owth and expansion phenomena in groups. In this talk\, he will discuss gro
 wth and expansion in groups\, including progress toward the celebrated Bab
 ai conjecture on the diameters of finite simple groups. See the blog anno
 uncement of this talk https://functor.network/user/3333/entry/1724 for mo
 re details.\n
LOCATION:https://stable.researchseminars.org/talk/th21/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ben Green (Prof.)
DTSTART:20260520T150000Z
DTEND:20260520T160000Z
DTSTAMP:20260424T221318Z
UID:th21/5
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/th21/
 5/">The polynomial Freiman-Ruzsa conjecture</a>\nby Ben Green (Prof.) as p
 art of Theorems of the 21st Century Seminar\n\nInteractive livestream: htt
 ps://teams.microsoft.com/meet/369493884995096?p=hToieGzGaKc9AwriDs\nLectur
 e held in Online only.\n\nAbstract\nProf. Ben Green is an internationally 
 renowned mathematician whose work spans additive combinatorics\, number th
 eory\, and related areas of analysis. He is widely known for groundbreakin
 g contributions such as the Green–Tao theorem on arithmetic progressions
  in the primes\, and has received numerous prestigious awards in recogniti
 on of his influence on modern mathematics. In this talk\, he will discuss 
 the polynomial Freiman–Ruzsa conjecture\, outlining its background\, key
  ideas\, and recent resolution\, as well as its role in shaping current re
 search in additive combinatorics. See the blog announcement of this talk f
 or more details at https://functor.network/user/3333/entry/1757\n
LOCATION:https://stable.researchseminars.org/talk/th21/5/
URL:https://teams.microsoft.com/meet/369493884995096?p=hToieGzGaKc9AwriDs
END:VEVENT
END:VCALENDAR