University of Oxford

The classical Universal Approximation Theorem certifies that the universal approximation property holds for the class of neural networks of arbitrary width. Here we consider the natural `dual' theorem for width-bounded networks of arbitrary depth, for a broad class of activation functions. In particular we show that such a result holds for polynomial activation functions, making this genuinely different to the classical case. We will then discuss some natural extensions of this result, e.g. for nowhere differentiable activation functions, or for noncompact domains.
 

We will discuss what it means to study the homology of a group via the construction of the classifying space. We will look at some examples of this construction and some of its main properties. We then use this to define and study the homology of the mapping class group of oriented surfaces, focusing on the approach used by Harer to prove his Homology Stability Theorem.

When Gromov defined non-positively curved cube complexes no one knew what they would be useful for.
Decades latex they played a key role in the resolution of the Virtual Haken conjecture.
In one of the early forays into experimenting with cube complexes, Aitchison, Matsumoto, and Rubinstein produced some nice results about certain "cubed" manifolds, that in retrospect look very prescient.
I will define non-positively curved cube complexes, what it means for a 3-manifold to be cubed, and discuss what all this Haken business is about.
 

A graph of groups decomposition is a way of splitting a group into smaller and hopefully simpler groups. A natural thing to try and do is to keep splitting until you can't split anymore, and then argue that this decomposition is unique. This is the idea behind JSJ decompositions, although, as we shall see, the strength of the uniqueness statement for such a decomposition varies depending on the class of groups that we restrict our edge groups to

Abstract: Gaussian multiplicative chaos (GMC) has attracted a lot of attention in recent years due to its applications in many areas such as Liouville CFT and random matrix theory, but despite its importance not much has been known about its distributional properties. In this talk I shall explain the study of the tail probability of subcritical GMC and establish a precise formula for the leading order asymptotics, resolving a conjecture of Rhodes and Vargas.

We will answer the following question: given a finite simplicial complex X acted on by a finite group G, which object stores the minimal amount of information about the symmetries of X in such a way that we can reconstruct both X and the group action? The natural first guess would be the quotient X/G, which remembers one representative from each orbit. However, it does not tell us the size of each orbit or how to glue together simplices to recover X. Our desired object is, in fact, a complex of groups. We will understand two processes: compression and reconstruction and see primarily through an example how to answer our initial question.

Every Cayley graph of a finitely generated group has some basic properties: they are locally finite, connected, and vertex-transitive. These are not sufficient conditions, there are some well known examples of graphs that have all these properties but are non-Cayley. These examples do however "look like" Cayley graphs, which leads to the natural question of if there exist any vertex-transitive graphs that are completely unlike any Cayley graph. I plan to give some of the history of this question, as well as the construction of the example that finally answered it.

The dynamics of many physical systems often evolve to asymptotic states that exhibit periodic spatial and temporal variations in their properties such as density, temperature, etc. Such regular patterns look the same when moved by a basic unit and/or rotated by certain special angles. They possess both translational and rotational symmetries giving rise to discrete spatial Fourier transforms. In contrast, an aperiodic crystal displays long range spatial order but no translational symmetry. 

Recently, quasicrystals which are related to aperiodic crystals have been observed to form in diverse physical systems such as metallic alloys (atomic scale) and dendritic-, star-, and block co-polymers (molecular scale). Such quasicrystals lack the lattice symmetries of regular crystals, yet have discrete Fourier spectra. We look to understand the minimal mechanism which promotes the formation of such quasicrystalline structures using a phase field crystal model. Direct numerical simulations combined with weakly nonlinear analysis highlight the parameter values where the quasicrystals are the global minimum energy state and help determine the phase diagram. 

By locating parameter values where multiple patterned states possess the same free energy (Maxwell points), we obtain states where a patch of one type of pattern (for example, a quasicrystal) is present in the background of another (for example, the homogeneous liquid state) in the form of spatially localized dodecagonal (in 2D) and icosahedral (in 3D) quasicrystals. In two dimensions, we compute several families of spatially localized quasicrystals with dodecagonal structure and investigate their properties as a function of the system parameters. The presence of such meta-stable localized quasicrystals is significant as they may affect the dynamics of the crystallisation in soft matter.