Previous Conferences & Workshops

One of the major open problems in complexity theory is proving super-polynomial lower bounds for circuits with logarithmic depth (i.e.,\(P \not\subseteq NC_1\) ). This problem is interesting both because it is tightly related to understanding the...

The study of random Cayley graphs of finite groups is related to the investigation of Expanders and to problems in Combinatorial Number Theory and in Information Theory. I will discuss this topic, describing the motivation and focusing on the...

Algebraic geometry and representation theory have played an important role in obtaining lower bounds in algebraic complexity theory. After giving an overview of the general set-up, I will present very recent results that indicate a possible role for...

The Gopakumar-Vafa conjecture predicts that the Gromov-Witten invariants of a Calabi-Yau 3-fold can be canonically expressed in terms of integer invariants called BPS numbers. In this talk, based on joint work with Tom Parker, I describe the proof...

To any bounded family of \(\mathbb F_\ell\)-linear representations of the etale fundamental of a curve \(X\) one can associate families of abstract modular curves which, in this setting, generalize the `usual' modular curves with level \(\ell\)...

We consider a system of harmonic oscillators with stochastic perturbations of the dynamics that conserve energy and momentum. In the one dimensional unpinned case, under proper space-time rescaling, Wigner distribution of energy converges to the...

Based on joint work with A. Guionnet (MIT). The beta ensemble is a particular model consisting of N strongly correlated real random variables. For specific values of beta, it is be realized by the eigenvalues of a random hermitian matrix whose...