## Near-Optimal Strong Dispersers

Randomness dispersers are an important tool in the theory of pseudorandomness, with numerous applications. In this talk, we will consider one-bit strong dispersers and show their connection to erasure list-decodable codes and Ramsey graphs.

## The Sample Complexity of Multi-Reference Alignment

## Drinfeld's lemma for schemes

## Academic Publishing: An Insider’s View

Princeton University Press will spearhead a discussion with others in the publishing realm on the current and future state of academic publishing.

*Dilworth Room, Simons Hall 12-2:00 p.m.*

Suggested Audience: IAS Members and Visitors and partners/spouses

Lunch will be provided. To register, click HERE.

## Analyticity results for the Navier-Stokes Equations

## Upper bounds for constant slope p-adic families of modular forms

## A Regularity Lemma with Modifications

Given an arbitrary graph, we show that if we are allowed to modify (say) 1% of the edges then it is possible to obtain a much smaller regular partition than in Szemeredi's original proof of the regularity lemma. Moreover, we show that it is impossible to improve upon the bound we obtain.

## Minmax minimal surfaces in arbitrary codimension with

We shall present a procedure which to any admissible family

of immersions

of surfaces into an arbitrary closed riemannian manifolds assigns a

smooth, possibly branched, minimal surface

whose area is equal to the width of the corresponding minmax and whose

Morse index is bounded by the

dimension of the familly. We will discuss the question of bounding the

Morse index + Nullity from below as well as possible extensions of

this procedure to more general families.

## The systole of large genus minimal surfaces in positive Ricci curvature

We prove that the systole (or more generally, any k-th

homology systole) of a minimal surface in an ambient three manifold of

positive Ricci curvature tends to zero as the genus of the minimal

surfaces becomes unbounded. This is joint work with Anna Siffert.