Previous Conferences & Workshops

Given a collection of constraints over a collection of variables consider the following generic constraint satisfaction algorithm: start with a random assignment of values to the variables; while violated constraints exist, select a random such...

Decoupling inequalities in harmonic analysis permit to bound the Fourier transform of measures carried by hyper surfaces by certain square functions defined using the geometry of the hyper surface. The original motivation has to do with issues in...

At the heart of every local search algorithm is a directed graph on candidate solutions (states) such that every unsatisfactory state has at least one outgoing arc. In stochastic local search the hope is that a random walk will reach a satisfactory...

In this talk I will present an approach to constructing finite energy foliations by pseudo-holomorphic curves with prescribed asymptotic orbits in the symplectization of a mapping torus. The idea is that so called maximally unlinked braids of...

Spectral curves appear in many integrable systems. Their quantum cousins are equally ubiquitous and describe among others random matrices, the topology of Riemann's moduli space, and hyperbolic knots. Quantum curves are the simplest example of what...

Let a circle act symplectically on a closed symplectic manifold $M$. If the action is Hamiltonian, we can pass to the reduced space; moreover, the fixed set largely determines the cohomology and Chern classes of $M$. In particular, symplectic circle...

This is a report on joint work in progress with T. Kragh, wherein we prove that a closed exact Lagrangian in a cotangent bundle is simply homotopy equivalent to the base. I will explain the two main ingredients of the proof: (i) realising the...

In this talk, I will present the recent joint work with Yi Zhu on $A^1$-connectedness for quasi-projective varieties. The theory of $A^1$-connectedness for quasi-projective varieties is an analogue of rationally connectedness for projective...

We give an explicit example for a Boolean function $f : \{0,1\}^n \to \{0,1\}$, such that every Boolean formula of size at most $n^{2.999}$, with gates AND, OR and NOT, computes $f$ correctly on at most $1/2 + \epsilon$ fraction of the inputs, where...