Past Events

We discuss constructions based on finite fields of three types of combinatorial arrays: orthogonal, covering and ordered orthogonal arrays. Other combinatorial arrays have been similarly considered in the literature, including permutation arrays...

A celebrated theorem of Jorgens-Calabi-Pogorelov says that global convex solutions to the Monge-Ampere equation det(D^2u) = 1 are quadratic polynomials. On the other hand, an example of Pogorelov shows that local solutions can have line singularities...

The Arab mathematician al-Khwarizmi is usually said to be the 'father of algebra', or otherwise that 'the Arabs invented algebra'. There is probably nothing in the previous sentence that is true (except the 'usually'). It turns out that the...

One of the most important techniques provided by modern logic is the use of models to show the consistency of theories. The technique burst onto the scene in the late 19th century, and had its most important early instance in demonstrating the...

Hyperbolic Lattices are tessellations of the hyperbolic plane using, for instance, heptagons or octagons. They are relevant for quantum error correcting codes and experimental simulations of quantum physics in curved space. Underneath their...

Abstract: The development of quantum electrodynamics is one of the major achievements of theoretical physics and mathematics of the 20th century, called the "Jewel of physics" by Richard Feynman. This talk is not about that. Instead, I explain two of...

In the classical pointwise ergodic theorem for a probability measure preserving (pmp) transformation \(T\), one takes averages of a given integrable function over the intervals \(\{x, T(x), T^2(x), \ldots, T^n(x)\}\) in the forward orbit of the point...

The asymmetric exclusion process (ASEP) is a model of particles hopping on a one-dimensional lattice. While it was initially introduced by Macdonald-Gibbs-Pipkin to provide a model for translation in protein synthesis, the stationary distribution of...

The $s$-colour size-Ramsey number of a hypergraph $H$ is the minimum number of edges in a hypergraph $G$ whose every $s$-edge-colouring contains a monochromatic copy of $H$. We show that the $s$-colour size-Ramsey number of the $t$-power of the $r$...