For every $\epsilon>0$ does there exist some $n\in\mathbb{N}$ and a bijection $f:\mathbb{Z}_n\to\mathbb{Z}_n$ such that $f(x+1)=2f(x)$ for at least $(1-\epsilon)n$ elements of $\mathbb{Z}_n$ and $f(f(f(f(x))))=(x)$ for all $x\in\mathbb{Z}_n$? I will discuss this question and its relation to an important open problem in the theory of countable discrete groups.

Multi-agent systems in nature oftentimes exhibit emergent behaviour, i.e. the formation of patterns in the absence of a leader or external stimuli such as light or food sources. We present a non-local two species crossinteraction model with cross-diffusion and explore its long-time behaviour. We observe a rich zoology of behaviours exhibiting phenomena such as mixing and/or segregation of both species and the formation of travelling pulses.

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.

A central theorem in combinatorics is Sperner’s Theorem, which determines the maximum size of a family in the Boolean lattice that does not contain a 2-chain. Erdos later extended this result and determined the largest family not containing a k-chain. Erdos and Katona and later Kleitman asked how many such chains must appear in families whose size is larger than the corresponding extremal result.

This question was resolved for 2-chains by Kleitman in 1966, who showed that amongst families of size M in the Boolean lattice, the number of 2-chains is minimized by a family whose sets are taken as close to the middle layer as possible. He also conjectured that the same conclusion should hold for all k, not just 2. The best result on this question is due to Das, Gan and Sudakov who showed roughly that Kleitman’s conjecture holds for families whose size is at most the size of the k+1 middle layers of the Boolean lattice. Our main result is that for every fixed k and epsilon, if n is sufficiently large then Kleitman’s conjecture holds for families of size at most (1-epsilon)2^n, thereby establishing Kleitman’s conjecture asymptotically (in a sense). Our proof is based on ideas of Kleitman and Das, Gan and Sudakov.

Joint work with Jozsef Balogh.