2021
Colloquium: Sebastian Hurtado (University of Chicago)
3:00–4:00 pm Eckhart Hall, Room 202
Sebastian Hurtado will present a talk as part of the Math Department’s Colloquia Series titled “Height Gaps, an Arithmetic Margulis Lemma and Almost Laws.”
Colloquium: Jeff Cheeger (NYU)
3:00–4:00 pm
Jeff Cheeger (NYU) will present a talk as part of the Math Department’s colloquia series titled “Noncollapsed Gromov-Hausdorff Limit Spaces with Ricci Curvature Bounded Below.”
Colloquium: Carolina Araujo (IMPA)
3:00–4:00 pm
Carolina Araujo (IMPA) will present a talk as part of the Math Department’s colloquia series titled “Symmetries in Algebraic Geometry.”
Zygmund-Calderón Lectures in Analysis
3:00–4:00 pm
The 2020-2021 Zygmund-Calderón Lectures in Analysis will be presented by Camillo de Lellis (IAS) on May 11, 13, and 14.
Zygmund-Calderón Lectures in Analysis
3:00–4:00 pm
The 2020-2021 Zygmund-Calderón Lectures in Analysis will be presented by Camillo de Lellis (IAS) on May 11, 13, and 14.
Colloquium: Chelsea Walton (Rice University)
3:00–4:00 pm
Chelsea Walton (Rice University) will present a talk as part of the Math Department’s Colloquia series titled “Quantum Symmetry”
Zygmund-Calderón Lectures in Analysis
3:00–4:00 pm
The 2020-2021 Zygmund-Calderón Lectures in Analysis will be presented by Camillo de Lellis (IAS) on May 11, 13, and 14.
Colloquium: Ivan Corwin (Columbia University)
3:00–4:00 pm Zoom Meeting
Ivan Corwin (Columbia University) will present a talk as part of the Math Department’s Colloquia series titled “Stationary Measure for the Open KPZ Equation.”
Colloquium: Lauren Williams (Harvard University)
3:00–4:00 pm Zoom Meeting
Lauren Williams (Harvard University) will present a talk as part of the Math Department’s Colloquia series titled “Macdonald and Schubert Polynomials from Markov Chains.”
Colloquium: Anders Hansen (University of Cambridge)
3:00–4:00 pm
Anders Hansen (University of Cambridge) will present a talk as part of the Math Department’s Colloquia series titled “The Extended Smale’s 9th problem — On hardness of approximation in computation and non-computable problems in computer-assisted proofs”