I will discuss how singular fibers in higher codimension in elliptically fibered Calabi-Yau fourfolds can be studied using Coulomb branch phases for d=3 supersymmetric gauge theories. This approach gives an elegent description of the generalized Kodaira fibers in terms of combinatorial/representation-theoretic objects called "box graphs", including the network of flops connecting distinct small resolutions. For physics applications, this approach can be used to constrain the possible matter spectra and possible U(1) charges (models with higher rank Mordell Weil group) for F-theory GUTs.

This is a report on an ongoing project to construct Calabi-Yau manifolds for which the Hodge numbers $(h^{11}, h^{21})$ are both relatively small. These manifolds are, in a sense, the simplest Calabi-Yau manifolds. I will report on joint work with Volker Braun, Andrei Constantin, Rhys Davies, Challenger Mishra and others.

In this talk I am going to discuss our recent and on-going work on an integral representation of tree-level S-matrices for massless particles. Starting from the formula for gravity amplitudes, I will introduce three operations acting on the integrand that produce compact and closed formulas for amplitudes in various other theories of massless bosons. In particular these includes Yang-Mills coupled to gravity, (Dirac)-Born-Infeld, U(N) non-linear sigma model, and Galileon theory. The main references are arXiv:1409.8256, arXiv:1412.3479.

The Number Field Sieve is the current practical and theoretical state of the art algorithm for factoring. Unfortunately, there has been no rigorous analysis of this type of algorithm. We randomise key aspects of the number theory, and prove that in this variant congruences of squares are formed in expected time $L(1/3, 2.88)$. These results are tightly coupled to recent progress on the distribution of smooth numbers, and we provide additional tools to turn progress on these problems into improved bounds.

Given two probability distributions $P_R$ and $P_B$ on the positive reals with finite means, colour the real line alternately with red and blue intervals so that the lengths of the red intervals have distribution $P_R$, the lengths of the blue intervals have distribution $P_B$, and distinct intervals have independent lengths. Now iteratively update this colouring of the line by coalescing intervals: change the colour of any interval that is surrounded by longer intervals so that these three consecutive intervals subsequently form a single monochromatic interval. Say that a colour (either red or blue) `wins' if every point of the line is eventually of that colour. I will attempt to answer the following question: under what natural conditions on the distributions is one of the colours almost surely guaranteed to win?

In Bass-Serre theory, one derives structural properties of groups from their actions on simplicial trees. In this talk, we introduce the theory of groups acting on $\mathbb{R}$-trees. In particular, we explain how the Rips machine is used to classify finitely generated groups which act freely on $\mathbb{R}$-trees.

I will look at some decidability questions for subgroups of Aut($F_n$) for general $n$. I will then discuss semisimple actions of Aut($F_n$) on complete CAT(0) spaces proving that the Nielsen moves will act elliptically. I will also look at proving Aut($F_3$) is large and if time permits discuss the fact that Aut($F_n$) is not Kähler

This talk will give an almost complete proof of the h-cobordism theorem, paying special attention to the sources of the dimensional restrictions in the theorem. If time allows, the alterations needed to prove its cousin, the s-cobordism theorem, will also be sketched.

If G is a semi-simple Lie group, it is known that all lattices
are arithmetic unless (up to finite index) G=SO(n,1) or SU(n,1).
Non-arithmetic lattices have been constructed in SO(n,1) for
all n and there are infinitely many non-arithmetic lattices in
SU(1,1). Mostow and Deligne-Mostow constructed 9 commensurability
classes of non-arithmetic lattices in SU(2,1) and a single
example in SU(3,1). The problem is open for n at least 4.
I will survey the history of this problem, and then describe
recent joint work with Martin Deraux and Julien Paupert, where
we construct 10 new commensurability classes of non-arithmetic
lattices in SU(2,1). These are the first examples to be constructed
since the work of Deligne and Mostow in 1986.