University of Warwick

For integers $k \ge 1$ and $n \ge 2k+1$, the Kneser graph $K(n,k)$ has as vertices all $k$-element subsets of an $n$-element ground set, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser graphs admit a Hamilton cycle, with one notable exception, namely the Petersen graph $K(5,2)$. This problem received considerable attention in the literature, including a recent solution for the sparsest case $n=2k+1$. The main contribution of our work is to prove the conjecture in full generality. We also extend this Hamiltonicity result to all connected generalized Johnson graphs (except the Petersen graph). The generalized Johnson graph $J(n,k,s)$ has as vertices all $k$-element subsets of an $n$-element ground set, and an edge between any two sets whose intersection has size exactly $s$. Clearly, we have $K(n,k)=J(n,k,0)$, i.e., generalized Johnson graphs include Kneser graphs as a special case. Our results imply that all known families of vertex-transitive graphs defined by intersecting set systems have a Hamilton cycle, which settles an interesting special case of Lovász' conjecture on Hamilton cycles in vertex-transitive graphs from 1970. Our main technical innovation is to study cycles in Kneser graphs by a kinetic system of multiple gliders that move at different speeds and that interact over time, reminiscent of the gliders in Conway’s Game of Life, and to analyze this system combinatorially and via linear algebra.

This is joint work with my students Arturo Merino (TU Berlin) and Namrata (Warwick).

We study “bottom-up” models for the collective motion of large groups of animals. Similar models can be encoded into (micro)robotic matter, capable of sensing light and processing information. Agents are endowed only with visual sensing and information processing. We study a model in which moving agents reorientate to maximise the path-entropy of their visual environment over paths into the future. There are general arguments that principles like this that are based on retaining freedom in the future may confer fitness in an uncertain world. Alternative “top-down” models are more common in the literature. These typically encode coalignment and/or cohesion directly and are often motivated by models drawn from physics, e.g. describing spin systems. However, such models can usually give little insight into how co-alignment and cohesion emerge because these properties are encoded in the model at the outset, in a top-down manner. We discuss how our model leads to dynamics with striking similarities with animal systems, including the emergence of coalignment, cohesion, a characteristic density scaling anddifferent behavioural phenotypes. The dynamics also supports a very unusual order-disorder transition in which the order (coalignment) initially increases upon the addition of sensory or behavioural noise, before decreasing as the noise becomes larger.

Many congruences between modular forms (or at least their q-expansions) can be explained by the theory of $p$-adic families of modular forms. In this talk, I will discuss properties of eigenvarieties, a geometric interpretation of the idea of $p$-adic families. In particular, focusing initially on the well-understood case of (elliptic) modular forms, before delving into the considerably murkier world of Bianchi modular forms. In this second case, this work gives numerical verification of a couple of conjectures, including BSD by work of Loeffler and Zerbes.

We will use Representation Theory to calculate systematically and efficiently the topological invariants of compact Lie groups and homogeneous spaces.
 

Most of the talk is covered by our second paper on ArXiv with John Jones and Adam Thomas, who are both at Warwick. The paper is part of the ongoing project to study the topological invariants of the four exceptional Rosenfeld projective planes.

We determine the minimal forbidden minors characterising the class of countable graphs that embed into some compact surface. We will also discuss Thomas’s conjecture that the Robertson—Seymour Graph Minor Theorem extends to countably infinite graphs. [https://arxiv.org/abs/2301.11042]

This talk presents some recent progress for models coupling large-strain, geometrically nonlinear elasto-plasticity with the movement of dislocations. In particular, a new geometric language is introduced that yields a natural mathematical framework for dislocation evolutions. In this approach, the fundamental notion is that of 2-dimensional "slip trajectories" in space-time (realized as integral 2-currents), and the dislocations at a given time are recovered via slicing. This modelling approach allows one to prove the existence of solutions to an evolutionary system describing a crystal undergoing large-strain elasto-plastic deformations, where the plastic part of the deformation is driven directly by the movement of dislocations. This is joint work with T. Hudson (Warwick).

I will report on current work in progress on the construction of anticyclotomic p-adic L-functions for Rankin--Selberg products. I will explain how by p-adically interpolating the branching law for the spherical pair (U(n)xU(n+1), U(n)) we can construct a p-adic L-function attached to cohomological automorphic representations of U(n) x U(n+1), including anticyclotomic variation. Due to the recent proof of the unitary Gan--Gross--Prasad conjecture, this p-adic L-function interpolates the square root of the central L-value. Time allowing, I will explain how we can extend this result to the Coleman family of an automorphic representation.

Is there a partition of the natural numbers into finitely many pieces, none of which contains a Pythagorean triple (i.e. a solution to the equation x²+y²=z²)? This is one of the simplest questions in arithmetic Ramsey theory which is still open. I will present a recent partial result, showing that in any finite partition of the natural numbers there are two numbers x,y in the same cell of the partition, such that x²+y²=z² for some integer z which may be in a different cell. 

The proof consists, after some initial maneuvers inspired by ergodic theory, in controlling the behavior of completely multiplicative functions along certain quadratic polynomials. Considering separately aperiodic and "pretentious" functions, the last major ingredient is a concentration estimate for functions in the latter class when evaluated along sums of two squares.

The talk is based on joint work with Frantzikinakis and Klurman.

We determine the minimal forbidden minors characterising the class of countable graphs that embed into some compact surface. We will also discuss Thomas’s conjecture that the Robertson—Seymour Graph Minor Theorem extends to countably infinite graphs. [https://arxiv.org/abs/2301.11042]

Metal forming involves permanently deforming metal into a required shape.  Many forms of metal forming are used in industry: rolling, stamping, pressing, drawing, etc; for example, 99% of steel produced globally is first rolled before any subsequent processing.  Most theoretical studies of metal forming use Finite Elements, which is not fast enough for real-time control of metal forming processes, and gives little extra insight.  As an example of how little is known, it is currently unknown whether a sheet of metal that is squashed between a large and a small roller should curve towards the larger roller, or towards the smaller roller.  In this talk, I will give a brief overview of metal forming, and then some progress my group have been making on some very simplified models of cold sheet rolling in particular.  The mathematics involved will include some modelling and asymptotics, multiple scales, and possibly a matrix Wiener-Hopf problem if time permits.