Past Events

Diophantine equations are one of the oldest, frequently celebrated and most abstract objects in mathematics. They crop up in areas ranging from recreational mathematics and puzzles, to cryptography, error correcting codes, and even in studying the...

Hopf invariants, a basic construction in homotopy theory, are closely related to Lusternik–Schnirelmann category which, in turn, can be defined as the sectional category of a certain evaluation map. In this talk I'll introduce the notion of Hopf...

We characterize the GFF as the only random distribution which is conformally invariant and satisfies a domain Markov property. Joint work with Nathanael Berestycki and Ellen Powell.

We examine the question of uniqueness for the equivariant reduction of the harmonic map heat flow in the energy supercritical dimension. It is shown that, generically, singular data can give rise to two distinct solutions which are both stable, and...

Visual computing is a wide area that includes computer graphics and image processing, where the ``eyeball-norm'' rules. I will briefly discuss two case studies involving numerical methods and analysis applied to this area. The first involves motion...

The julia programming language is designed to be a high level language for numerical computing, that is as fast as C or Fortran, despite employing a high level syntax. Since its first release in 2012 it has been continually improved and build a fast...

We study the propagation of chaos for the N-particle chemotaxis system subject to the Brownian diffusion. More precisely, we present a probabilistic proof of the distance between the exact microscopic and the approximate mean-field dynamics, which...

We explore how Fourier-Motzkin elimination, a standard tool in finite dimensional linear programming, can be used to understand the duality theory of more general optimization problems, including semi-infinite linear, convex and conic programming...

In many applications one wishes to minimize an objective function that is not convex and is not differentiable at its minimizers. We discuss two algorithms for minimization of nonsmooth, nonconvex functions. Gradient Sampling is a simple method that...

This workshop is a joint activity between the Atlantic Algebra Centre and the Network of Ontario Lie Theorists focusing on modern developments in the theory of group actions (gradings on algebras, actions on lattices and varieties) and its...