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:20260622T224555Z
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:20260622T224555Z
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:20260622T224555Z
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:20260622T224555Z
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\nLecture held in Online only.
 \n\nAbstract\nProf. Harald Helfgott is a leading mathematician who made fu
 ndamental contribution to number theory\, group theory\, and additive comb
 inatorics. He is widely known for his proof of the ternary Goldbach conjec
 ture\, as well as for foundational contributions to the study of growth an
 d expansion phenomena in groups. In this talk\, he will discuss growth and
  expansion in groups\, including progress toward the celebrated Babai conj
 ecture on the diameters of finite simple groups. See the blog announcemen
 t of this talk https://functor.network/user/3333/entry/1724 for more deta
 ils.\n
LOCATION:https://researchseminars.org/talk/th21/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ben Green (Prof.)
DTSTART:20260520T150000Z
DTEND:20260520T160000Z
DTSTAMP:20260622T224555Z
UID:th21/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/th21/5/">The
  polynomial Freiman-Ruzsa conjecture</a>\nby Ben Green (Prof.) as part of 
 Theorems of the 21st Century Seminar\n\nLecture held in Online only.\n\nAb
 stract\nProf. Ben Green is an internationally renowned mathematician whose
  work spans additive combinatorics\, number theory\, and related areas of 
 analysis. He is widely known for groundbreaking contributions such as the 
 Green–Tao theorem on arithmetic progressions in the primes\, and has rec
 eived numerous prestigious awards in recognition of his influence on moder
 n mathematics. In this talk\, he will discuss the polynomial Freiman–Ruz
 sa conjecture\, outlining its background\, key ideas\, and recent resoluti
 on\, as well as its role in shaping current research in additive combinato
 rics. See the blog announcement of this talk for more details at https://f
 unctor.network/user/3333/entry/1757\n
LOCATION:https://researchseminars.org/talk/th21/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andrew Lobb and Joshua Greene (Prof.)
DTSTART:20260610T150000Z
DTEND:20260610T160000Z
DTSTAMP:20260622T224555Z
UID:th21/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/th21/6/">Ins
 cription Problems and Symplectic Geometry</a>\nby Andrew Lobb and Joshua G
 reene (Prof.) as part of Theorems of the 21st Century Seminar\n\nLecture h
 eld in Online only.\n\nAbstract\nProf. Andrew Lobb and Prof. Joshua Greene
  are leading mathematicians whose work has made important contributions to
  several areas of geometry and topology. In this talk\, they will discuss 
 recent progress on classical inscription problems\, including striking res
 ults showing that every smooth Jordan curve inscribes a rectangle similar 
 to any prescribed rectangle\, and more generally a cyclic quadrilateral si
 milar to any prescribed cyclic quadrilateral. The talk will highlight the 
 ideas behind these theorems and explain the connection to symplectic geome
 try. See the blog announcement https://functor.network/user/3333/entry/181
 3 of this talk for more details.\n
LOCATION:https://researchseminars.org/talk/th21/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Oleg Pikhurko (Prof.)
DTSTART:20260701T150000Z
DTEND:20260701T160000Z
DTSTAMP:20260622T224555Z
UID:th21/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/th21/7/">Squ
 aring the Circle</a>\nby Oleg Pikhurko (Prof.) as part of Theorems of the 
 21st Century Seminar\n\nInteractive livestream: https://teams.microsoft.co
 m/meet/351664072159319?p=2yK7qFQUp1FirD32v9\nLecture held in Online only.\
 n\nAbstract\nDate: July 1\, 2026 (Wednesday) at 4PM (UK time)\n\nSpeakers:
  Prof. Oleg Pikhurko\, University of Warwick\, UK\n\nTopic: Squaring the C
 ircle\n\nAbout the Talk: Prof. Oleg Pikhurko is a leading mathematician wh
 ose work has made major contributions to extremal combinatorics\, graph th
 eory\, random structures\, and related areas of mathematics. In this talk\
 , he will discuss the famous problem of squaring the circle: whether a dis
 k can be cut into finitely many pieces and rearranged to form a square of 
 the same area. The talk will outline the history of this classical problem
 \, from its ancient geometric origins to recent breakthroughs. See the blo
 g announcement https://functor.network/user/3333/entry/1846 of this talk f
 or more details.\n
LOCATION:https://researchseminars.org/talk/th21/7/
URL:https://teams.microsoft.com/meet/351664072159319?p=2yK7qFQUp1FirD32v9
END:VEVENT
END:VCALENDAR