Past Events

Mammalian orthoreovirus (reovirus) is naturally an enteric virus that spreads among most mammals without causing disease. Reovirus also can infect and kill cancer cells while leaving normal cells unharmed, and is now in phase III clinical trials as a...

Abstract: In this talk I will introduce several geometric data sets related to the distance function either on Riemannian or Finsler manifolds with boundary. I consider differences of these data sets, and for each of them I will provide geometric...

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...

We describe a thin family of Dirichlet L-functions which have an irregular and perhaps unexpected behavior in their value distribution. This behavior has an arithmetic explanation and corresponds to the nonvanishing of a certain Gauss type sum. We...

Nati Linial raised the following basic problem in 2006: given a k-dimensional simplicial complex S, how many facets can a k-complex on n vertices have if it contains no topological copy of S? This is a beautiful and natural question, but results in...

The first goal of this talk will be to introduce the dendroidal world, which generalises the simplicial world. Instead of working with the category Delta, we will work with the category Omega, a category of trees, introduced by Moerdijk and Weiss...

This talk will present the framework of weak optimal transport which allows to incorporate more general penalizations on elementary mass transports. After recalling general duality results and different optimality criteria, we will focus on recent...

The distance matrix of a connected graph $G$ is an $n \times n$ matrix $D(G) = [d_{ij}]$, where $d_ij$ is the distance between the vertices $v_i$ and $v_j$ . The distance spectrum of $G$ is ${\lambda_1, . . . , \lambda_n}$, where $\lambda_i$ are the...

Let \(G\) be a finite group acting transitively on \(X\). We say \(g,h \in G\) are intersecting if \(gh^{-1}\) fixes a point in \(X\). A subset \(S\) of \(G\) is said to be an intersecting set if every pair of elements in \(S\) intersect. Cosets of...

Abstract: Given a finite graph, the arboreal gas is the measure on forests (subgraphs without cycles) in which each edge is weighted by a parameter β>0. Equivalently this model is bond percolation conditioned to be a forest, the independent sets of...