Recently, as part of a project to find CY manifolds for which both the Hodge numbers (h^{11}, h^{21}) are small, manifolds have been found with Hodge numbers (4,1) and (1,1). The one-dimensional special geometries of their complex structures are more complicated than those previously studied. I will review these, emphasising the role of the fundamental period and Picard-Fuchs equation. Two arithmetic aspects arise: the first is the role of \zeta(3) in the monodromy matrices and the second is the fact, perhaps natural to a number theorist, that through a study of the CY manifolds over finite fields, modular functions can be associated to the singular manifolds of the family. This is a report on joint work with Volker Braun, Xenia de la Ossa and Duco van Straten.

Graphons and permutons are analytic objects associated with convergent sequences of graphs and permutations, respectively. Problems from extremal combinatorics and theoretical computer science led to a study of graphons and permutons determined by finitely many substructure densities, which are referred to as finitely forcible. The talk will contain several results on finite forcibility, focusing on the relation between finite forcibility of graphons and permutons. We also disprove a conjecture of Lovasz and Szegedy about the dimension of the space of typical vertices of finitely forcible graphons. The talk is based on joint work with Roman Glebov, Andrzej Grzesik and Dan Kral.

The study of infrared singularities, due to the emission of “soft” (low momentum) gauge bosons, remains a highly active research area in a variety of quantum field theories. After motivating both phenomenological and formal reasons as to why we should care about IR singularities, this talk will review their structure in QED, QCD and quantum gravity, examining the similarities and differences between these three contexts. The role of Wilson lines will be examined, which provide a useful unifying language. Finally, I will examine recent work on moving beyond the soft approximation, and why this might be useful.

A fundamental theorem of Wilson states that, for every graph $F$, every sufficiently large $F$-divisible clique has an $F$-decomposition. Here $G$ has an $F$-decomposition if the edges of $G$ can be covered by edge-disjoint copies of $F$ (and $F$-divisibility is a trivial necessary condition for this). We extend Wilson's theorem to graphs which are allowed to be far from complete (joint work with B. Barber, D. Kuhn, A. Lo).

I will also discuss some results and open problems on decompositions of dense graphs and hypergraphs into Hamilton cycles and perfect matchings.