Past Events

To describe the cellular self-aggregation phenomenon, some strongly coupled PDEs named as Keller-Segel (KS) and Patlak-Keller-Segel (PKS) systems were proposed in 1970s. Since KS and PKS systems possess relatively simple structures but admit rich...

Euler’s famous formula tells us that (with appropriate caveats), a map on the sphere with f countries (faces), e borders (edges), and v border-ends (vertices) will satisfy v-e+f=2. And more generally, for a map on a surface with g holes, v-e+f=2-2g...

Bilevel optimization has been widely used in a variety of areas such as adversarial training, hyperparameter tuning, image reconstruction meta-learning, neural architecture search, and reinforcement learning. In this talk, I will present first-order...

In 1954, Tutte made a conjecture that every graph without a cut-edge has a nowhere-zero 5-flow. A parallel conjecture to this, but for signed graphs is Bouchet’s Conjecture (1983) that every signed graph without the obvious obstruction has a nowhere...

Knowledge of the behaviour of random walks on a fintiely generated group G carries a lot of information about intrinsic properties of G. The simplest and the most well-known demonstration of this principle is the Kesten's criterion of the amenability...

If A is an algebra over a field k, and R is an augmented commutative k-algebra, then an R-deformation of A is (intuitively) an R-algebra B whose underlying k-algebra structure is isomorphic to that of A. Two R-deformations of A are considered...

Turing patterns have been suggested as an explanation for morphogenesis in a variety of organisms. Despite the fact that morphogenesis occurs during growth, most studies of Turing patterns have been conducted on static domains. We present...

This is a report from team Functor Calculus at the 4th Women in Topology conference. In earlier work, K. Hess and B. Johnson invented a way of producing what they call “calculus towers” from comonads. These calculus towers generalize functor calculus...

For graphs $G, H_1,\dots,H_r$, write $G \to (H_1, \ldots, H_r)$ to denote the property that whenever we $r$-colour the edges of $G$, there is a monochromatic copy of $H_i$ in colour $i$ for some $i \in \{1,\dots,r\}$. Mousset, Nenadov and Samotij...

Many results in algebraic graph theory can be viewed as upper bounds on the size of the automorphism group of graphs satisfying various hypotheses. These kinds of results have many applications. For example, Tutte's classical theorem on 3-valent arc...