Past Events

From a directed graph $Q$, called a quiver, one can construct what is known as a quiver variety $Y_Q$, an algebraic variety defined as a quotient of a vector space by a group defined in terms of $Q$. A mutation of a quiver is an operation that...

In this talk I will explain how to obtain a local to global principle for expected values over free ℤ-modules of finite rank. We use the same philosophy as Ekedhal’s Sieve for densities, later extended and improved by Poonen and Stoll in their local...

The backtracking line-search is an effective technique to automatically tune the step-size in smooth optimization. It guarantees similar performance to using the theoretically optimal step-size. Many approaches have been developed to instead tune per...

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

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

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