Previous Conferences & Workshops

Finding cliques in random graphs and the related planted variant where one wants to recover an added clique of size $k$ added to a random $G(n, 1/2)$ graph, have been extensively studied questions in algorithm design. Despite intense effort, state...

I will present asymptotic upper and lower bounds for the supremum norms of Maass forms of growing Laplace eigenvalue on a wide class of semisimple groups. I will also present a general lower bound in the level aspect that improves over the trivial...

The problem of the density of squarefree discriminant polynomials is an old one, being considered by many people, and the density being conjectured by Lenstra. A proof has been out of question for a long time. The reason it was desired is that a...

After recalling some recent developments in symplectic flexibility, I will introduce a class of open symplectic manifolds, called "subflexible", which are not flexible but become so after attaching some Weinstein handles. For example, the standard...

Although the existence of a totally geodesic surface in a finite volume hyperbolic 3-manifold is "rare", when they do exist, their presence seems to have an impact on the geometry and topology of the hyperbolic 3-manifold, as well as number...

Random band matrices (RBM) are natural intermediate models to study eigenvalue statistics and quantum propagation in disordered systems, since they interpolate between mean-field type Wigner matrices and random Schrodinger operators. In particular...

This talk will give a brief outline of the algorithm, followed by technical details of the second combinatorial partitioning algorithm ("Split-or-Johnson" routine) required for the group theoretic recurrence. The technical material will be...

The Min-max Theory for the area functional, started by Almgren in the early 1960s and greatly improved by Pitts in 1981, was left incomplete because it gave no Morse index estimate for the min-max minimal hypersurface. Nothing was said also about...

The algorithm indicated in the title builds on Luks's classical framework and introduces new group theoretic and combinatorial tools. In the first talk we outline the algorithm and state the core group theoretic and algorithmic ingredients. Some of...