I will review the recently exposed connection between N=2 superconformal field theories in four dimensions and vertex operator algebras (VOAs). I will outline some general features of the VOAs that arise in this manner and describe the manner in which they reflect four-dimensional operations such as gauging and Higgsing. Time permitting, I will also touch on the modular properties of characters of these VOAs.

Pure spinor space, a cone over orthogonal Grassmannian OGr(5,10), is a central concept in the Berkovits formulation of string theory. The space of states of the beta-gamma system on pure spinors is tensor factor in the Hilbert space of string theory . This is why it would be nice to have a good definition of this space of states. This is not a straightforward task because of the conical singularity of the target. In the talk I will explain a strategy for attacking  conical targets. In the case of pure spinors the method gives a formula for partition function of pure spinors.

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.