Previous Conferences & Workshops

Feb
07
2018

Mathematical Conversations

An Introduction to Univalent Foundations
Daniel Grayson
6:00pm|Dilworth Room

The Univalent Foundations of Voevodsky offer not only a formal language for use in computer verification of proofs, but also a foundation of mathematics alternative to set theory, in which propositions and their proofs are mathematical objects, and...

Feb
07
2018

Analysis Seminar

Nodal sets of Laplace eigenfunctions
1:30pm|Simonyi Hall 101

Zero sets of Laplace eigenfunctions are called nodal sets. The talk will focus on propagation of smallness techniques, which are useful for estimates of the Hausdorff measure of the nodal sets.

Feb
06
2018

Computer Science/Discrete Mathematics Seminar II

Outlier-Robust Estimation via Sum-of-Squares
10:30am|Simonyi Hall 101

We develop efficient algorithms for estimating low-degree moments of unknown distributions in the presence of adversarial outliers. The guarantees of our algorithms improve in many cases significantly over the best previous ones, obtained in recent...

Feb
06
2018

Locally Symmetric Spaces Seminar

Moment map for spherical varieties (after F. Knop)
10:00am

We will discuss Knop's paper "The asymptotic behavior of invariant collective motion" which analyzes the moment map for a spherical variety and relates it to a Weyl group.

Feb
05
2018

Joint IAS/Princeton University Symplectic Geometry Seminar

Immersed Lagrangians near SYZ singular fibres
4:00pm|Fine Hall 322, Princeton University

One of the key problem in mirror symmetry is that singular fibres in higher dimensional SYZ fibrations of sufficiently interesting spaces (e.g. the quintic 3-fold) have bad singularities. This makes it unreasonable to directly define their...

Feb
05
2018

Computer Science/Discrete Mathematics Seminar I

Locally Repairable Codes, Storage Capacity and Index Coding
Arya Mazumdar
11:00am|Simonyi Hall 101

An error-correcting code is called locally repairable if any coordinate of a codeword can be recovered by accessing only few other coordinates. For locally repairable codes over small alphabets (such as binary), the optimal trade-off between...