Previous Conferences & Workshops

We prove a \(\tilde{\Omega}(n^{1/5})\) lower bound on the query complexity of any non-adaptive two-sided error algorithm for testing whether an unknown n-variable Boolean function is monotone versus constant-far from monotone. This gives an...

This workshop was part of the topical program "Non-equilibrium Dynamics and Random Matrices" which took place during the 2013-2014 academic year at the Institute for Advanced Study.

The workshop aimed to provide...

In this talk, I will explain the recent joint work with Bohui Chen and Anmin Li on virtual neighborhood techniques for a Fredholm system \((B, E, S)\), where \(E\) is a Banach vector bundle over a Banach manifold \(B\) with a Fredholm section. Using...

By studying the variation of motivic path torsors associated to a variety, we show how certain nondensity assertions in Diophantine geometry can be translated to problems concerning K-groups. Then we use some vanishing theorems to obtain concrete...

We discuss some properties of a version of the one-dimensional totally asymmetric zero-range process in which a particle hops to the nearest neighbor site with rate proportional to \(1-q^n\), with \(n\) being the number of particles at the site. The...