I will present a $\Gamma$-convergence for degenerate integral functionals related to homogenisation problems  in the Heisenberg group. In our  case, both the rescaling and the notion of invariance or periodicity are chosen in a way motivated by the geometry of the Heisenberg group. Without using special geometric features, these functionals would be neither coercive nor periodic, so classic results do not apply.  All the results apply to the more general case of Carnot groups. Joint with Nicolas Dirr, Paola Mannucci and Claudio Marchi.

Gauss noted quadratic reciprocity to be among his favourite results, and any undergrad will quickly pick up on just how strange it is despite a plethora of elementary proofs. By 1930, E. Artin had finalized Artin reciprocity which wondrously subsumed all previous generalizations, but was still confined to abelian contexts. An amicable non-abelian reciprocity remains a driving force in number-theoretic research.

In this talk, I'll recount Artin reciprocity and show it implies quadratic and cubic reciprocity. I'll then talk about some candidate non-abelian reciprocities, and in particular, which morals of Artin reciprocity they preserve.

The Toda integrable system was originally designed as a specific model for lattice field theories. Following Kostant's insights, we will explain how it naturally arises from the representation theory of Lie algebras, and present some more recent work relating it to cotangent bundles of Lie groups and the topology of Affine Grassmannians.

Given a tournament with $d{n \choose 3}$ cycles of length three, how many cycles of length four must there be? Linial and Morgenstern (2016) conjectured that the minimum is asymptotically attained by "blowing up" a transitive tournament and orienting the edges randomly within the parts. This is reminiscent of the tight examples for the famous Triangle and Clique Density Theorems of Razborov, Nikiforov and Reiher. We prove the conjecture for $d \geq \frac{1}{36}$ using spectral methods. We also show that the family of tight examples is more complex than expected and fully characterise it for $d \geq \frac{1}{16}$. Joint work with Timothy Chan, Andrzej Grzesik and Daniel Král'.

Consider all planar graphs on n vertices. What is the smallest graph that contains them all as induced subgraphs? We provide an explicit construction of such a graph on $n^{4/3+o(1)}$ vertices, which improves upon the previous best upper bound of $n^{2+o(1)}$, obtained in 2007 by Gavoille and Labourel.

In this talk, we will gently introduce the audience to the notion of so-called universal graphs (graphs containing all graphs of a given family as induced subgraphs), and devote some time to a key lemma in the proof. That lemma comes from a recent breakthrough by Dujmovic et al. regarding the structure of planar graphs, and has already many interesting consequences - we hope the audience will be able to derive more. This is based on joint work with Cyril Gavoille and Michal Pilipczuk.