Past Events

Zero forcing is a type of graph propagation based on the color-change rule: Given graph $G$, if each vertex of $G$ is colored either white or blue, and vertex $v$ is a blue vertex with only one white neighbor $w$, then change the color of $w$ to blue...

I will try to present an overview of some results of unbalanced optimal transport for positive measures with different total masses, showing the crucial role of the so-called cone representation and of the corresponding homogeneous marginals. The...

The problem of finding minimizers of functions on graphs arises naturally in many different domains, for example, exponential random graphs and extremal combinatorics. In Euclidean setting, there are two widely used approaches for minimizing a given...

We will introduce rational homotopy theory through the CDGA approach and discuss formal and non-formal spaces. We will then move on to a moduli problem related to the homotopy type of complements of polyhedra in closed manifolds.

I will report on a simple model for collective self-organization in colonies of myxobacteria. Mechanisms include only running, to the left or to the right at fixed speed, and tumbling, with a rate depending on head-on collisions. We show that...

I will provide a (very basic) tutorial on the Curry-Howard correspondence between proofs (in natural deduction) and terms in the typed -calculus. No prior knowledge of either will be presupposed.

In 1962, Tutte proposed a simple method to produce a straight-line embedding of a planar graph in the plane, known as Tutte's spring theorem. It leads to a surprisingly simple proof of a classical theorem proved by Bloch, Connelly, and Henderson in...

We introduce a combinatorial object corresponding to a graph G, called a special rim hook G-tabloid. We construct sign-reversing maps on these special rim hook G-tabloids to prove that a family of claw-free graphs called generalized nets are Schur...

The random interlacement point process (introduced by Sznitman, generalized by Teixeira) is a Poisson point process on the space of labeled doubly infinite nearest neighbour trajectories modulo time-shift on a transient graph G. We show that the...

The size function h0 for a number field is analogous to the dimension of the Riemann-Roch spaces of divisors on an algebraic curve. Van der Geer and Schoof conjectured that h0 attains its maximum at the trivial class of Arakelov divisors if that...