Previous Conferences & Workshops

Unfortunately counting prime numbers is hard. Fortunately, we can cheat by counting 'approximate prime numbers' which is much easier. Moreover, this allows us to say something about the primes themselves, and works in situations which seem well...

Lattices are periodic arrangements of points in space that have attracted the attention of mathematicians for over two centuries. They have recently become an object of even greater interest due to their remarkable applications in cryptography. In...

For initial datum of finite kinetic energy Leray has proven in 1934 that there exists at least one global in time finite energy weak solution of the 3D Navier-Stokes equations. In this talk, I will discuss very recent joint work with Vlad Vicol in...

Existing unconditional progress on the abc conjecture and Szpiro's conjecture is rather limited and coming from essentially only two approaches: The theory of linear forms in $p$-adic logarithms, and bounds for the degree of modular parametrizations...

In the lectures I will formulate a conjecture asserting that there is a hidden action of certain motivic cohomology groups on the cohomology of arithmetic groups. One can construct this action, tensored with $\mathbb C$, using differential forms...

Geometric Complexity Theory (GCT) was developed by Mulmuley and Sohoni as an approach towards the algebraic version of the P vs NP problem, VP vs VNP, and, more generally, proving lower bounds on arithmetic circuits. Exploiting symmetries, it...

We will explain a definition of open Gromov-Witten invariants on the rational elliptic surfaces and explain the connection of the invariants with tropical geometry. For certain rational elliptic surfaces coming from meromorphic Hitchin system, we...

This talk is going to be an extended and more technical version of my brief public lecture https://www.ias.edu/ideas/2017/arora-zemel-machine-learningI will present some of the basic ideas of machine learning, focusing on the mathematical...

A fundamental problem in Bayesian statistics is sampling from distributions that are only specified up to a partition function (constant of proportionality). In particular, we consider the problem of sampling from a distribution given access to the...

We show that there exist binary locally testable codes (for all rates) and locally correctable codes (for low rates) with rate and distance approaching the Gilbert-Varshamov bound (which is the best rate-distance tradeoff known for general binary...