Previous Conferences & Workshops

In the 1930s, Einstein, Podolsky and Rosen devised the "EPR paradox", which shed light on a peculiar phenomenon in the mathematical modeling of quantum mechanics:  Very far apart particles can exhibit correlated behaviour, which seemed to suggest a...

Let $q,Q$ be two integral quadratic forms in $m n$
variables. One can ask when $q$ can be represented by $Q$ - that is,
whether there exists an $n \times m$-integer matrix $T$ such that $ Q \circ T = q $.  Naturally, a necessary condition is that...

In the Calculus of Variations, convexity plays a seemingly irreplaceable role.
For vectorial problems, however, for good reasons a whole zoo of its generalizations was introduced. It ranges  from notions based on very classical
observation over...

In this talk we will construct (approximate) locally list decodable codes from high dimensional expanders (HDXs).

Last week we saw that locally list decoding is a powerful tool from coding theory. We also got a subspace-based construction of...

The compactly supported cohomology groups of the locally symmetric space for $GL_n(Z)$ form, as n varies the $E_1$ page of a spectral sequence. This spectral sequence was introduced by Quillen in 1973 in his proof of finite generation of $K$-groups...

One of the primary goals of the mathematical analysis of algorithms is to provide guidance about which algorithm is the “best” for solving a given computational problem. Worst-case analysis summarizes the performance profile of an algorithm by its...

Over 40 years ago, Karp, Upfal, and Wigderson posed a central open question in parallel computation: how many adaptive rounds are needed to find a basis of a matroid using only independence queries? Their pioneering work gave an upper bound of $O(...

Speaker #1 (Tran): On a projective variety, Simpson showed that there is a homeomorphism between the moduli space of semisimple flat bundles and that of polystable Higgs bundles with vanishing Chern classes. Recently, Bakker, Brunebarbe and...