C1

Last year, G. Kings and D. Rossler related the degree zero part of the polylogarithm
on abelian schemes pol^0 with another object previously defined by V. Maillot and D.
Rossler. More precisely, they proved that the canonical class of currents constructed
by Maillot and Rossler provides us with the realization of pol^0 in analytic Deligne
cohomology.
I will show that, adding some properness conditions, it is possible to give a
refinement of Kings and Rossler’s result involving Deligne-Beilinson cohomology
instead of analytic Deligne cohomology.

Consider the following question. Given a $k$-colouring of the positive integers, must there exist a solution to $x+y=z^2$ with $x,y,z$ all the same colour (and not all equal to 2)? Using $10$ colours a counterexample can be given to show that the answer is "no". If one instead asks the same question over $\mathbb{Z}/p\mathbb{Z}$ for some prime $p$, the answer turns out to be "yes", provided $p$ is large enough in terms of the number of colours used.  I will talk about how to prove this using techniques developed by Ben Green and Tom Sanders. The main ingredients are a regularity lemma, a counting lemma and a Ramsey lemma.

Many theorems and conjectures in prime number theory are equivalent to finding solutions to certain linear equations in primes -- witness Goldbach's conjecture, the twin prime conjecture, Vinogradov's theorem, finding k-term arithmetic progressions, etcetera. Classically these problems were attacked using Fourier analysis -- the 'circle' method -- which yielded some success, provided that the number of variables was sufficiently large. More recently, a long research programme of Ben Green and Terence Tao introduced two deep and wide-ranging techniques -- so-called 'higher order Fourier analysis' and the 'transference principle' -- which reduces the number of required variables dramatically. In particular, these methods give an asymptotic formula for the number of k-term arithmetic progressions of primes up to X. In this talk we will give a brief survey of these techniques, and describe new work of the speaker, partially ongoing, which applies the Green-Tao machinery to count prime solutions to certain linear inequalities in primes -- a 'higher order Davenport-Heilbronn method'. 

A question by Poonen asks whether iterating the étale-Brauer set can give a finer obstruction set. We tackle the algebraic version of Poonen's question and give, in many cases, a negative answer.

Quasihomomorphisms (QHMs) are maps $f$ between groups such that the
homomorphic condition is boundedly satisfied. The case of QHMs with
abelian target is well studied and is useful for computing the second
bounded cohomology of groups. The case of target non-abelian has,
however, not been studied a lot.

We will see a technique for classifying QHMs $f: G \rightarrow H$ by Fujiwara and
Kapovich. We will give examples (sometimes with proofs!) for QHM in
various cases such as

• the image $H$  hyperbolic groups,
• the image $H$ discrete rank one isometries,
• the preimage $G$ cyclic / free group, etc.

Furthermore, we point out a relation between QHM and extensions by short
exact sequences.

A family of expanders is a sequence of finite graphs which are both sparse and highly connected. Firstly defined in the 80s, they had huge applications in applied maths and computer science. Moreover, it soon turned out that they also had deep implications in pure maths. In this talk I will introduce the expander graphs and I will illustrate a way to construct them by approximating actions of groups on probability spaces.

I will discuss a notoriously hard problem in group theory known as the flat closing conjecture. This states that a group with a finite classifying space is either hyperbolic or contains a Baumslag-Solitar Subgroup. I will give some strategies to try and create a counterexample to this conjecture. 

In 1964 Golod and Shafarevich discovered a powerful tool that gives a criteria for when a certain presentation defines an infinite dimensional algebra. In my talk I will assume the main machinery of the Golod-Shafarevich inequality for graded algebras and use it to provide counter examples to certain analogues of the Burnside problem in infinite dimensional algebras and infinite groups. Then, time dependent, I will define the Tarski number for groups relating to the Banach-Tarski paradox and show that we can using the G-S inequality show that the set of Tarski numbers is unbounded. Despite the fact we can only find groups of Tarski number 4, 5 and 6.