ICM 2026 Plenary Lecture - Tamar Ziegler

Value of the Information & Strength of the Argument

The lecture provides a high-value synthesis of a complex field, offering both historical context and modern perspectives. Ziegler’s argumentation is rigorous and well-structured, moving from simple examples (e.g., vector spaces over F3) to general principles. She clearly explains the guiding principle that unexpected counts of patterns imply structural obstructions, and she systematically builds the necessary machinery (Fourier analysis, ergodic theory, Gowers norms, nilsequences) to support this. The presentation is logically coherent, with each concept motivated by the preceding discussion. The inclusion of open questions and recent applications adds to the value, making it a comprehensive overview suitable for mathematicians familiar with the basics.

Scientific Rigor, Source Quality, Title Accuracy

The lecture demonstrates high scientific rigor, with careful attribution of results to their authors (e.g., Roth, Szemerédi, Furstenberg, Green, Tao, Host, Kra, and Ziegler herself). The sources are primarily the foundational papers and theorems in the field, which are well-established and peer-reviewed. The title accurately reflects the content, as the lecture indeed focuses on the structure of sets with unexpected numbers of arithmetic patterns. The presentation is self-contained, with definitions and explanations provided for key concepts, ensuring clarity for the audience. No external sources are cited in the video description, but the lecture itself references the relevant literature implicitly.

The title accurately reflects the content: a plenary lecture on the structure of sets with unexpected numbers of arithmetic patterns, delivered by Tamar Ziegler.

9/10

Lecture by a leading expert (Tamar Ziegler) at the ICM, presenting a survey of established results and recent developments in ergodic theory and additive combinatorics. The content is mathematically rigorous, with clear logical progression and references to key theorems and authors. The presentation is authoritative and reliable, though it is a survey rather than a peer-reviewed publication.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 00:00Introduction by session chair, highlighting Ziegler's achievements.
• 02:00Ziegler begins her talk, outlining the problem of arithmetic patterns in sets.
• 05:00Discussion of random sets and expected counts of arithmetic progressions.
• 10:00Introduction of the guiding principle: unexpected counts reveal structure.
• 15:00Roth's theorem and the Roth-Meshulam dichotomy for three-term progressions.
• 20:00Szemerédi's theorem and Furstenberg's ergodic-theoretic proof.
• 25:00Higher-order obstructions: nilsystems and characteristic factors for longer progressions.
• 30:00Introduction of Gowers norms and their role in detecting structure.
• 35:00Inverse theorems for Gowers norms and correlation with nilsequences.
• 40:00Application to primes: Green-Tao theorem and counting arithmetic progressions in primes.
• 45:00Open questions and future directions in the field.