C5

In this talk, I will explain part of the programme of Gorenstein, Lyons

and Solomon (GLS) to provide a new proof of the CFSG. I will focus on

the difference between the initial notion of groups of characteristic

$2$-type (groups like Lie type groups of characteristic $2$) and the GLS

notion of groups of even type. I will then discuss work in progress

with Capdeboscq to study groups of even type and small $2$-local odd

rank. As a byproduct of the discussion, a picture of the structure of a

finite simple group of even type will emerge.

For a finitely presented group, the Word Problem asks for an algorithm

which declares whether or not words on the generators represent the

identity. The Dehn function is the time-complexity of a direct attack

on the Word Problem by applying the defining relations.

A "hydra phenomenon" gives rise to novel groups with extremely fast

growing (Ackermannian) Dehn functions. I will explain why,

nevertheless, there are efficient (polynomial time) solutions to the

Word Problems of these groups. The main innovation is a means of

computing efficiently with compressed forms of enormous integers.

This is joint work with Will Dison and Eduard Einstein.

In 1997 V. Bentkus and F. Götze introduced a technique for estimating $L^p$ norms of certain exponential sums without needing an explicit estimate for the exponential sum itself. One uses instead a kind of estimate I call a "moat lemma". I explain this term, and discuss the implications for several kinds of point-counting problem which we all know and love.

Hrushovski-Martin-Rideau have proved rationality of Poincare series counting 
numbers of equivalence classes of a definable equivalence relation on the p-adic field (in connection to a problem on counting representations of groups). For this they have proved 
uniform p-adic elimination of imaginaries. Their work implies that these Poincare series are 
motivic. I will talk about their work.

We show that for every $n\ge 2$ there exists a torsion-free one-ended word-hyperbolic group $G$ of rank $n$ admitting generating $n$-tuples $(a_1,\ldots ,a_n)$ and $(b_1,\ldots ,b_n)$ such that the $(2n-1)$-tuples $$(a_1,\ldots ,a_n, \underbrace{1,\ldots ,1}_{n-1 \text{ times}})\hbox{ and }(b_1,\ldots, b_n, \underbrace{1,\ldots ,1}_{n-1 \text{ times}} )$$ are not Nielsen-equivalent in $G$. The group $G$ is produced via a probabilistic construction (joint work with Ilya Kapovich).

This will be an informal discussion developing the details of the Amplituhedron for the loop integrand.

The 'pyjama stripe' is the subset of the plane consisting of a vertical

strip of width epsilon about every integer x-coordinate. The 'pyjama

problem' asks whether finitely many rotations of the pyjama stripe about

the origin can cover the plane.

I'll attempt to outline a solution to this problem. Although not a lot

of this is particularly representative of techniques frequently used in

additive combinatorics, I'll try to flag up whenever this happens -- in

particular ideas about 'limit objects'.

TQFTs have received widespread attention in recent years. In mathematics

for example due to Lurie's proof of the cobordism hypothesis. In physics

they are used as toy models to understand structure, especially

boundaries and defects.

I will present a lattice construction of 2d Spin TFT. This mostly

motivated as both a toy model and stepping stone for a mathematical

construction of rational conformal field theories with fermions.

I will first describe a combinatorial model for spin surfaces that

consists of a triangulation and a finte set of extra data. This model is

then used to construct TFT correlators as morphisms in a symmetric

monoidal category, given a Frobenius algebra as input. The result is

shown to be independent of the triangulation used, and one obtains thus

a 2dTFT.

All results and constructions can be generalised to framed surfaces in a

relatively straightforward way.