## Transfer operators between relative trace formulas in rank one II

I will introduce a new paradigm for comparing relative trace formulas, in order to prove instances of (relative) functoriality and relations between periods of automorphic forms.

Yiannis Sakellaridis

Rutgers University; von Neumann Fellow, School of Mathematics

December 19, 2017

I will introduce a new paradigm for comparing relative trace formulas, in order to prove instances of (relative) functoriality and relations between periods of automorphic forms.

James Maynard

Member, School of Mathematics

December 13, 2017

Amir Shpilka

Tel Aviv University

December 12, 2017

We study the complexity of constructing a hitting set for the class of polynomials that can be infinitesimally approximated by polynomials that are computed by polynomial sized algebraic circuits, over the real or complex numbers. Specifically, we show that there is a PSPACE algorithm that given nsr in unary outputs a set of inputs from of size poly(nsr), with poly(nsr) bit complexity, that hits all $n$-variate polynomials of degree $r$ that are the limit of size $s$ algebraic circuits.

Yiannis Sakellaridis

Rutgers University; von Neumann Fellow, School of Mathematics

December 12, 2017

Vicky Kaspi

McGill University

December 12, 2017

Yann LeCun

December 12, 2017

Lenny Ng

Duke University

December 11, 2017

Knot contact homology is a knot invariant derived from counting holomorphic curves with boundary on the Legendrian conormal to a knot. I will discuss some new developments around the subject, including an enhancement that completely determines the knot (joint work with Tobias Ekholm and Vivek Shende) and recent progress in the circle of ideas connecting knot contact homology, recurrence relations for colored HOMFLY polynomials, and topological strings (joint work in progress with Tobias Ekholm).

Daniel Kane

University of California, San Diego

December 11, 2017

It is classically understood how to learn the parameters of a Gaussian even in high dimensions from independent samples. However, estimators like the sample mean are very fragile to noise. In particular, a single corrupted sample can arbitrarily distort the sample mean. More generally we would like to be able to estimate the parameters of a distribution even if a small fraction of the samples are corrupted, potentially adversarially.

Matthias Schwarz

Universität Leipzig; Member, School of Mathematics

December 11, 2017

Alex Kontorovich

Rutgers University; von Neumann Fellow, School of Mathematics

December 8, 2017

We will explain how the circle method can be used in the setting of thin orbits, by sketching the proof (joint with Bourgain) of the asymptotic local-global principle for Apollonian circle packings. We will mention extensions of this method due to Zhang and Fuchs-Stange-Zhang to certain crystallographic circle packings, as well as the method's limitations.