After mentioning, by way of motivation (mine at least), some diophantine questions concerning
sets definable in the restricted analytic, exponential field $\R_{an, exp}$, I discuss the
problem of extending a given $\R_{an, exp}$-definable function $f:(a, \infty) \to \R$ to
a holomorphic function $\hat f : \{z \in \C : Re(z) > b \} \to \C$ (for some $b > a$).
In particular, I give a necessary and sufficient condition on $f$ for such an $\hat f$ to exist and be
$\R_{an, exp}$-definable.
 

After a brief review of holographic features of general relativity in 3 and 4 dimensions, I will show how to derive the transformation laws of the Bondi mass and angular momentum aspects under finite supertranslations, superrotations and complex Weyl rescalings.
 

In this talk I will present a class of super-Wilson loops in N=4 super Yang-Mills theory. The expectation value of these operators has been shown previously to be invariant under a Yangian symmetry. I will show how the kinematics of such super-Wilson loops can be described in a twistorial way and how this leads to compact, manifestly super-conformal invariant expressions for some two-point functions.
 

The Feynman diagram expansion of scattering amplitudes in perturbative superstring theory can be written (for closed strings) as a series of integrals over compactified moduli spaces of Riemann surfaces with marked points, indexed by the genus. Therefore in genus 0 it is reasonable to find, as it often happens in QFT computations, periods of M_{0,N}, which are known to be multiple zeta values. In this talk I want to report on recent advances in the genus 1 amplitude, which are related to the development of 2 different generalizations of classical multiple zeta values, namely elliptic multiple zeta values and conical sums.

The large sieve is a powerful analytic tool in number theory, with many beautiful and diverse applications. In its most general form it resembles an approximate Bessel's inequality, and this clear modern theory rests on the combined effort of countless mathematicians in the mid-twentieth century -- Linnik, Roth, Selberg, Montgomery, Vaughan, and Bombieri, to name a few. However, it is hardly obvious to the beginner why this rather abstract inequality should be called 'large', or 'sieve'. In this introductory talk, aimed particularly at new graduate students, we discuss the rudimentary theory of the large sieve, some particular applications to sieving problems, and (at least one) proof. 

The Graham-Pollak theorem states that to decompose the complete graph $K_n$ into complete bipartite subgraphs we need at least $n-1$ of them. What
happens for hypergraphs? In other words, suppose that we wish to decompose the complete $r$-graph on $n$ vertices into complete $r$-partite $r$-graphs; how many do we need?

In this talk we will report on recent progress on this problem. This is joint work with Luka Milicevic and Ta Sheng Tan.

It follows from the ellipsoid method and results of Grotschel, Lovasz and Schrijver that one can find an optimal colouring of a perfect graph in polynomial time. But no ''combinatorial'' algorithm to do this is known.

Here we give a combinatorial algorithm to do this in an n-vertex perfect graph in time O(n^{k+1}^2) where k is the clique number; so polynomial-time for fixed k. The algorithm depends on another result, a polynomial-time algorithm to find a ''balanced skew partition'' in a perfect graph if there is one.

Joint work with Maria Chudnovsky, Aurelie Lagoutte, and Sophie Spirkl.

For a graph $G$, the $k$-colour Ramsey number $R_k(G)$ is the least integer $N$ such that every $k$-colouring of the edges of the complete graph $K_N$ contains a monochromatic copy of $G$. Let $C_n$ denote the cycle on $n$ vertices. We show that for fixed $k\geq2$ and $n$ odd and sufficiently large,
$$
R_k(C_n)=2^{k-1}(n-1)+1.
$$
This resolves a conjecture of Bondy and Erdős for large $n$. The proof is analytic in nature, the first step of which is to use the regularity method to relate this problem in Ramsey theory to one in nonlinear optimisation.  This allows us to prove a stability-type generalisation of the above and establish a correspondence between extremal $k$-colourings for this problem and perfect matchings in the $k$-dimensional hypercube $Q_k$.

In joint work with Olof Sisask, we establish new quantitative bounds for Roth's theorem on arithmetic progressions, showing that a set of integers with no three-term arithmetic progressions must have density O(1/(log N)^{1+c}) for some absolute constant c>0. This is the integer analogue of a result of Bateman and Katz for the model setting of vector spaces over a finite field, and the proof follows a similar structure. 

The threshold for existence of a giant component in a random graph with given vertex degrees was found by Molloy and Reed (1995), and several authors have since studied the size of the largest and other components in various cases. The critical window was found by Hatami and Molloy (2012), and has a width that depends on whether the asymptotic degree distribution has a finite third moment or not. I will describe some new results (joint work with Remco van der Hofstad and Malwina Luczak) on the barely supercritical case, where this difference between finite and infinite third moment also is seen.