Previous Conferences & Workshops

The Brunn-Minkowski inequality is a fundamental result in convex geometry controlling the volume of  the sum of subsets of $\mathbb{R}^n$. It asserts that for  sets $A,B\subset \mathbb{R}^n$ of equal volume and a parameter $t\in(0,1)$, we have $|tA+...

The analytic de Rham stack is a new construction in Analytic Geometry whose theory of quasi-coherent sheaves encodes a notion of p-adic D-modules. It has the virtue that can be defined even under lack of differentials (eg. for perfectoid spaces or...

Expansion in graphs is a well studied topic, with a wealth of applications in many areas of mathematics and the theory of computation.

High dimensional expansion is a generalization of expansion from graphs to higher dimensional objects, such as...

Recent advancements in quantum error correction have led to breakthroughs in good quantum low-density parity-check (qLDPC) codes, which offer asymptotically optimal code rates and distances. However, several open questions remain, including the...

The Cohen-Lenstra heuristics are influential conjectures in arithmetic statistics from 1984 which predict the average number of p-torsion elements in class groups of quadratic fields, for p an odd prime. So far, this average number has only been...

The study of the topology of hyperplane arrangement complements has long been a central part of combinatorial algebraic geometry. I will talk about intersection pairings on the twisted (co)homology for a hyperplane arrangement complement, first...

You are swimming at the center of a circular lake with a bear waiting on the shore. The bear, unable to swim, moves four times faster on land than you do in water, but once on land, you can outrun it. Can you escape?

This classic riddle has been...