Previous Conferences & Workshops

One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits. Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995) suggested approaching this problem by proving that depth...

I will describe some new "coarse-graining" methods in quantitative homogenization and how they can be used to give rigorous versions of certain heuristic "renormalization group" arguments in physics, with a focus on several examples.

A fractal uncertainty principle (FUP) roughly says that a 
function and its Fourier transform cannot both be concentrated on a 
fractal set. These were introduced to harmonic analysis in order to 
prove new results in quantum chaos: if eigenfunctions...

For a low-dimensional manifold, one often tries to understand its intrinsic topology and geometry through its submanifolds, in particular of co-dimension 1. To be interesting and to give some information, such a submanifold should interact with the...

I will first review what we know about the toroidal and minimal compactifications of Shimura varieties and their integral models, and the well-positioned subschemes of these integral models.  Then I will explain some p-adic analogues of Harris and...

Cohomology of classifying space/stack of a group G is the home which resides all characteristic classes of G-bundles/torsors. In this talk, we will try to explain some results on Hodge/de Rham cohomology of BG where G is a $p$-power order...

A weighted pseudorandom generator (WPRG) is a generalization of a pseudorandom generator (PRG) in which, roughly speaking, probabilities are replaced with weights that are permitted to be positive or negative. In this talk, we present new explicit...