Previous Conferences & Workshops

Logarithmic Gromov-Witten invariants generalize usual and relative Gromov-Witten invariants and were first suggested by Siebert and then recently introduced by Gross-Siebert and Abramovich-Chen. Applications include more general degeneration...

We describe a simple yet surprisingly powerful probabilistic technique that shows how to find, in a dense graph, a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently, this technique has had...

A celebrated theorem of Roth from 1953 shows that every dense set of integers contains a three-term arithmetic progression. This has been the starting point for the development of an enormous amount of beautiful mathematics. In this talk, I will...

Singular algebraic (sub)varieties are fundamental to the theory of smooth projective manifolds. In parallel with his introduction of pseudo-holomorphic curve techniques into symplectic topology 30 years ago, Gromov asked about the feasibility of...

The sum-of-squares (SOS) method is a conceptually simple algorithmic technique for polynomial optimization that---quite surprisingly---captures and generalizes the best known efficient algorithms for a wide range of NP-hard optimization problems...

Understanding the structure of large graphs is a fundamental problem, as it can yield critical insights into topics ranging from the spread of diseases to how the brain works to patterns in the primes. Szemerédi's regularity lemma gives a rough...

Monotonicity testing has been a touchstone problem in property testing for more than fifteen years, with many exciting recent developments in just the past few years. When specialized to Boolean-valued functions over $\{0,1\}^n$, we are interested...