Past Events

Any translation surface can be presented as a collection of polygons in the plane with sides identified. By acting linearly on the polygons, we obtain an action of GL(2,R) on moduli spaces of translation surfaces. Recent work of Eskin, Mirzakhani...

Diffusion methods help understand and denoise data sets; when there is additional structure (as is often the case), one can use (and get additional benefit from) a fiber bundle model.

The Monge transfer problem goes back to the 18th century. It consists in minimizing the transport cost of a material from a place to another (and changing the shape). Monge could not solve the problem and the next significant step was achieved 150...

For a given $\epsilon > 0$, we say that a graph $G$ is $\epsilon$-flexibly $k$-choosable if the following holds: for any assignment $L$ of lists of size $k$ on $V(G)$, if a preferred color is requested at any set $R$ of vertices, then at least $...

Mechanical forces play an essential role in development, most evidently as the drivers of morphogenesis, but also potentially as long-range signals contributing to embryonic self-organization. Regulative development is particularly evident in...

We prove that skew systems with a sufficiently expanding base have "approximate" statistical properties similar to random ergodic Markov chains. For example, they exhibit approximate exponential decay of correlations, meaning that the exponential...

Abstract:A set of geometric graphs is geometric-packable if it can be asymptotically packed into every sequence of drawings of the complete graph K_n. For example, the set of geometric triangles is geometric-packable due to the existence of Steiner...

Abstract: Multi-marginal optimal transport in the general mathematical problem of aligning several probability distributions with maximal efficiency, relative to a given cost function. While many applications for this problem have emerged over the...

The Erdos-Hajnal conjecture states that for every graph H there exists $c > 0$ such that every n-vertex graph $G$ either contains $H$ as an induced subgraph, or has a clique or stable set of size at least $n^c$. I will talk about a proof of this...

Abstract: We study stochastic motion of objects in micrometer-scale living systems: proteins in the nucleus, organelles in cells, and pathogens in mucus barriers. Phenomena such as self organization emerges from the behavior of single individuals...