Past Events

Abstract: In this talk, we study an algebraic approach to fusions of synchronization models. The Lohe tensor model is a generalized synchronization model which contains three synchronization models; the Kuramoto model(on the circle), the swarm sphere...

Abstract: Conformally invariant equations in n \geq 3 have played an important role in the study of \sigma_2-Yamabe problem in geometric analysis. In this talk, we will discuss a class of Mobius invariant equations in dimension two and then present a...

Abstract: The capillary effect caused by the interfacial energy dominates the dynamics of small droplets, particularly the contact lines (where three phases meet). With insoluble surfactant laid on the capillary surface, the adhesion of droplets to...

The stochastic heat equation (driven space-time white noise) arises from interface growth dynamics via the Kardar-Parisi-Zhang equation and from the theory of disordered systems via continuum directed random polymers. Despite these physical relations...

Consider a group G acting transitively on the vertices of an infinite, cubic (3-regular) graph Gamma such that the vertex stabilizers are infinite. We will see that if G is also edge-transitive on Gamma, then Gamma is the infinite cubic tree, and if...

Abstract: I will introduce a skeleton obtained directly from monomial relations in a finite quiver without cycles, and relate the construction to some classical examples in mirror symmetry. This is work in progress with David Favero. Speaker...

Stein’s method is a set of techniques for bounding distances between probability measures via integration-by-parts formulas. It was introduced by Stein in the 1980s for bouding the rate of convergence in central limit theorems, and has found many...

Abstract: Voronoi tessellations give rise to a wealth of analytic, geometric, and computational questions. They are also very useful in modelling. This talk will consist of three parts. In the first, I will address the simple, yet rich, question of...

A perfect matching (   P M ) in the complete graph K 2 k K 2 k is a set of edges by which every vertex is covered exactly once. Two   P M s are said to be t t -intersecting if they have at least t t edges in common. Another type pf intersection...