Birmingham

 I will explore subtle aspects of rank-one 4d N=2 supersymmetric QFTs through their low-energy Coulomb-branch physics. This low-energy Lagrangian is famously encoded in the Seiberg-Witten (SW) curve, which is a one-parameter family of elliptic curves. Less widely appreciated is the fact that various properties of the QFTs, including properties that cannot be read off from the Lagrangian, are nonetheless encoded into the SW curve, in particular in its Mordell-Weil group. This includes the global form of the flavour group, the one-form symmetries under which defect lines are charged, and the "global form" of the theory. In particular, I will discuss in detail the difference between the pure SU(2) and the pure SO(3) N=2 SYM theories from this perspective. I will also comment on 5d SCFTs compactified on a circle in this context.

I will discuss how to construct cycles of many different lengths in graphs, in particular answering the following two problems on odd and even cycles. Erdős and Hajnal asked in 1981 whether the sum of the reciprocals of the odd cycle lengths in a graph diverges as the chromatic number increases, while, in 1984, Erdős asked whether there is a constant $C$ such that every graph with average degree at least $C$ contains a cycle whose length is a power of 2.

Abstract:   Let $f$ be a continuous surjection from the compact metric space $X$ to itself. 

We say that the dynamical system $(X,f)$ has shadowing if for every $\epsilon>0$ there is a $\delta>0$ such that every $\delta$-pseudo orbit is $\epsilon$-shadowed.  Here a sequence $(x_n)$ is a $\delta$-pseudo orbit provided the distance from $f(x_n)$ to $x_{n+1}$ is less than $\delta$ and $(x_n)$ is $\epsilon$-shadowed if there is a point $z$ such that the distance from $x_n$ to $f^n(z)$ is less than $\epsilon$.  

If $f$ is a homeomorphism, $(X,f)$ is said to be expansive if there is some $c>0$, such that if the distance from $f^n(x)$ and $f^n(y)$ is less than $c$ for all $n\in \mathbb Z$, then $x=y$.

In his proof that a homeomorphism that is expansive and has shadowing is stable, Walters shows that in an expansive system with shadowing, a pseudo orbit is shadowed by exactly one point.  It turns out that the converse is also true: if the system has unique shadowing (in the above sense), then it is expansive.

In this talk, which is joint work with Joel Mitchell and Joe Thomas, we explore this notion of unique shadowing.

In combinatorics, the 'nicest' way to prove that two sets have the same size is to find a bijection between them, giving more structure to the seeming numerical coincidences. In representation theory, many of the outstanding conjectures seem to imply that the characteristic p of the ground field can be allowed to vary, and we can relate different groups and different primes, to say that they have 'the same' representation theory. In this talk I will try to make precise what we could mean by this

The last remaining open problem from Erdős and Rényi's original paper on random graphs is the following: for q at least 3, what is the largest d so that the random graph G(n,d/n) is q-colorable with high probability?  A lot of interesting work in probabilistic combinatorics has gone into proving better and better bounds on this q-coloring threshold, but the full answer remains elusive.  However, a non-rigorous method from the statistical physics of glasses - the cavity method - gives a precise prediction for the threshold.  I will give an introduction to the cavity method, with random graph coloring as the running example, and describe recent progress in making parts of the method rigorous, emphasizing the role played by tools from extremal combinatorics.  Based on joint work with Amin Coja-Oghlan, Florent Krzakala, and Lenka Zdeborová.

Komlós conjectured in 1981 that among all graphs with minimum degree at least $d$, the complete graph $K_{d+1}$ minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We prove this conjecture when $d$ is sufficiently large.  In fact we prove a stronger result: for large $d$, any graph $G$ with average degree at least $d$ contains almost twice as many Hamiltonian subsets as $K_{d+1}$, unless $G$ is isomorphic to $K_{d+1}$ or a certain other graph which we specify. This is joint work with Hong Liu, Maryam Sharifzadeh and Katherine Staden.