# Events and Activities

Explore current and upcoming events and activities happening at the Institute for Advanced Study.

### Joint PU/IAS Number Theory

In this talk we present explicit bounds for the Weil height and the number of integral points on classical surfaces first studied by Clebsch (1871) and Klein (1873). Building on Hirzebruch's work in which he related these surfaces to a Hilbert...

### What is...?

Combinatorial discrepancy asks the following question: Given a ground set U and a collection S of subsets of U, how do we color each element in U red or blue so that each subset in S has almost an equal number of each color? A straightforward idea is...

### Computer Science/Discrete Mathematics Seminar I

In this talk, I will present the following two connections between private optimization and statistical physics, both via the problem of approximating a given covariance matrix with a low-rank matrix:

- An efficient algorithm to privately compute a low...

### Computer Science/Discrete Mathematics Seminar I

In this talk, I will present the following two connections between private optimization and statistical physics, both via the problem of approximating a given covariance matrix with a low-rank matrix:

- An efficient algorithm to privately compute a low...

### Symplectic Geometry Seminar

It is well known that all contact 3-manifolds can be obtained from the standard contact structure on the 3-sphere by contact surgery on a Legendrian link. Hence, an interesting and much studied question asks what properties are preserved under...

### Joint IAS/Princeton Arithmetic Geometry Seminar

Let K be a finite extension of Qp. The Emerton-Gee stack for GL2 is a stack of etale (phi, Gamma)-modules of rank two. Its reduced part, X, is an algebraic stack of finite type over a finite field, and can be viewed as a moduli stack of two...

### Computer Science/Discrete Mathematics Seminar II

Random restrictions are a powerful tool used to study the complexity of boolean functions. Various classes of boolean circuits are known to simplify under random restrictions. A prime example of this, discovered by Subbotovskaya more than 60 years...

### Computer Science/Discrete Mathematics Seminar II

Random restrictions are a powerful tool used to study the complexity of boolean functions. Various classes of boolean circuits are known to simplify under random restrictions. A prime example of this, discovered by Subbotovskaya more than 60 years...