L4

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).

A rooted tree $T$ has degree sequence $(d_1,\ldots,d_n)$ if $T$ has vertex set $[n]$ and vertex $i$ has $d_i$ children for each $i$ in $[n]$. 

I will describe a line-breaking construction of random rooted trees with given degree sequences, as well as a way of coupling random trees with different degree sequences that also couples their heights to one another. 

The construction and the coupling have several consequences, and I'll try to explain some of these in the talk.

First, let $T$ be a branching process tree with critical—mean one—offspring distribution, and let $T_n$ have the law of $T$ conditioned to have size $n$. Then the following both hold.
1) $\operatorname{height}(T_n)/\log(n)$ tends to infinity in probability. 
2) If the offspring distribution has infinite variance then $\operatorname{height}(T_n)/n^{1/2}$ tends to $0$ in probability. This result settles a conjecture of Svante Janson.

The next two statements relate to random rooted trees with given degree sequences. 
1) For any $\varepsilon > 0$ there is $C > 0$ such that the following holds. If $T$ is a random tree with degree sequence $(d_1,\ldots,d_n)$ and at least $\varepsilon n$ leaves, then $\mathbb{E}(\operatorname{height}(T)) < C \sqrt{n}$. 
2) Consider any random tree $T$ with a fixed degree sequence such that $T$ has no vertices with exactly one child. Then $\operatorname{height}(T)$ is stochastically less than $\operatorname{height}(B)$, where $B$ is a random binary tree of the same size as $T$ (or size one greater, if $T$ has even size). 

For a compact Lie group $G$, its massless Coulomb branch algebra is the $G$-equivariant Borel-Moore homology of its based loop space. This algebra is the same as the algebra of regular functions on the BFM space. In this talk, we will explain how this algebra acts on the equivariant symplectic cohomology of Hamiltonian $G$-manifolds when the symplectic manifolds are open and convex. This is a generalization of the closed case where symplectic cohomology is replaced with quantum cohomology. Following Teleman, we also explain how it relates to the Coulomb branch algebra of cotangent-type representations. This is joint work with Eduardo González and Dan Pomerleano.

A subset in the ideal boundary of a CAT(0) space is called symmetric if every complete geodesic with one ideal boundary point
in the set has both ideal boundary points in the set. In the late 80s Eberlein proved that if a Hadamard manifold contains a non-trivial closed symmetric  subset in its ideal boundary, then its holonomy group cannot act transitively. This leads to rigidty via
the Berger-Simons Theorem. I will discuss rigidity of ideal symmetric sets in the general context of locally compact geodesically complete
CAT(0) spaces.
 

Bicommutant categories, initially invented for the purposes of Chern-Simons theory and 2d CFT, seem to also appear in other domains of math with examples related to group theory, and dynamical systems.

Given an infinite discrete group G with a finite model for the classifying space for proper actions, one can define the Euler characteristic of G and the orbifold Euler characteristic of G. In this talk we will discuss higher chromatic analogues of these invariants in the sense of stable homotopy theory. We will study the Morava K-theory of G and associated Euler characteristic, and give a character formula for the Lubin-Tate theory of G. This will generalise the results of Hopkins-Kuhn-Ravenel from finite to infinite groups and the K-theoretic results of Adem, Lück and Oliver from chromatic level one to higher chromatic levels. At the end we will mention explicit computations for some arithmetic groups and mapping class groups in terms of class numbers and special values of zeta functions. This is all joint with Wolfgang Lück and Stefan Schwede.

I will speak about a central question in higher algebra (aka brave new algebra), namely which rings or schemes admit 'higher models', that is lifts to the sphere spectrum. This question is in some sense very classical, but there are many open questions. These questions are closely related to questions about higher versions of prismatic cohomology and delta ring, asked e.g. by Scholze and Lurie. Concretely we will consider the case of group algebras and explain how to understand maps between lifts of group algebras to the sphere spectrum. The results we present are joint with Carmeli and Yuan and on the prismatic side with Antieau and Krause.