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:20260522T182803Z UID:th21/1 DESCRIPTION:Title: Sphere packing\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: END:VEVENT BEGIN:VEVENT SUMMARY:Avi Wigderson (Prof.) DTSTART:20260211T160000Z DTEND:20260211T170000Z DTSTAMP:20260522T182803Z UID:th21/2 DESCRIPTION:Title: Expander graphs\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: END:VEVENT BEGIN:VEVENT SUMMARY:Assaf Naor (Prof.) DTSTART:20260304T160000Z DTEND:20260304T170000Z DTSTAMP:20260522T182803Z UID:th21/3 DESCRIPTION:Title: Sparsest cut\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: END:VEVENT BEGIN:VEVENT SUMMARY:Harald Helfgott (Prof.) DTSTART:20260415T150000Z DTEND:20260415T160000Z DTSTAMP:20260522T182803Z UID:th21/4 DESCRIPTION:Title: Growth\, expansion and escape in groups\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: END:VEVENT BEGIN:VEVENT SUMMARY:Ben Green (Prof.) DTSTART:20260520T150000Z DTEND:20260520T160000Z DTSTAMP:20260522T182803Z UID:th21/5 DESCRIPTION:Title: The polynomial Freiman-Ruzsa conjecture\nby Ben Green (Prof.) as p art of Theorems of the 21st Century Seminar\n\nLecture held in Online only .\n\nAbstract\nProf. Ben Green is an internationally renowned mathematicia n whose work spans additive combinatorics\, number theory\, and related ar eas of analysis. He is widely known for groundbreaking contributions such as the Green–Tao theorem on arithmetic progressions in the primes\, and has received numerous prestigious awards in recognition of his influence o n modern mathematics. In this talk\, he will discuss the polynomial Freima n–Ruzsa conjecture\, outlining its background\, key ideas\, and recent r esolution\, as well as its role in shaping current research in additive co mbinatorics. See the blog announcement of this talk for more details at ht tps://functor.network/user/3333/entry/1757\n LOCATION: END:VEVENT BEGIN:VEVENT SUMMARY:Andrew Lobb and Joshua Greene (Prof.) DTSTART:20260610T150000Z DTEND:20260610T160000Z DTSTAMP:20260522T182803Z UID:th21/6 DESCRIPTION:Title: Inscription Problems and Symplectic Geometry\nby Andrew Lobb and J oshua Greene (Prof.) as part of Theorems of the 21st Century Seminar\n\nIn teractive livestream: https://teams.microsoft.com/meet/347806020565562?p=6 97eyDB6J31i9WHT5D\nLecture held in Online only.\n\nAbstract\nProf. Andrew Lobb and Prof. Joshua Greene are leading mathematicians whose work has mad e important contributions to several areas of geometry and topology. In th is talk\, they will discuss recent progress on classical inscription probl ems\, including striking results showing that every smooth Jordan curve in scribes a rectangle similar to any prescribed rectangle\, and more general ly a cyclic quadrilateral similar to any prescribed cyclic quadrilateral. The talk will highlight the ideas behind these theorems and explain the co nnection to symplectic geometry. See the blog announcement https://functor .network/user/3333/entry/1813 of this talk for more details.\n LOCATION:https://teams.microsoft.com/meet/347806020565562?p=697eyDB6J31i9W HT5D URL:https://teams.microsoft.com/meet/347806020565562?p=697eyDB6J31i9WHT5D END:VEVENT END:VCALENDAR