Previous Conferences & Workshops

I will describe the problem of finding the homotopy type of the space of quantum Hamiltonians in dimension d under certain constraints. The common assumptions are that the interactions have finite range and that the ground state is separated from...

We discuss some recent results on singularity properties of word maps and Lie algebra word maps on semisimple algebraic groups and semisimple Lie algebras, generalizing a work of Aizenbud-Avni done in the case of the commutator map. These...

We show evidence that homological mirror symmetry is a phenomenon that exists beyond the world of Kähler manifolds by exhibiting HMS-type results for a family of complex surfaces which includes the classical Hopf surface (S^1 x S^3). Each surface S...

The "nearest neighbor (NN) classifier" labels a new data instance by taking a majority vote over the k most similar instances seen in the past. With an appropriate setting of k, it is capable of modeling arbitrary decision rules. Traditional...

In this talk, I'll illustrate how to lift a "small" locally testable code via a high dimensional expander (HDX) to a "large" locally testable code. Given a D-left regular bipartite graph G = ([n], [m], E) and a "small" code C \in {0,1}^D, the Tanner...

In this talk I will discuss some definitions of exponential mixing and other rates of mixing and discuss some of its consequences.

We will discuss the problem of constructing and characterizing uniquely, integral models of Shimura varieties over some primes where non-smooth reduction is expected.

A main theme in extremal combinatorics is about asking when the random construction is close to optimal. A famous conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if $H$ is a bipartite graph, then the random graph with edge density $p$...