Can we extend the FEM to general polytopic, i.e. polygonal and polyhedral, meshes while retaining 
the ease of implementation and computational cost comparable to that of standard FEM? Within this talk, I present two approaches that achieve just  that (and much more): the Virtual Element Method (VEM) and an hp-version discontinuous Galerkin (dG) method.

The Virtual Element spaces are like the usual (polynomial) finite element spaces with the addition of suitable non-polynomial functions. This is far from being a novel idea. The novelty of the VEM approach is that it avoids expensive evaluations of the non-polynomial "virtual" functions by basing all 
computations solely on the method's carefully chosen degrees of freedom. This way we can easily deal 
with complicated element geometries and/or higher continuity requirements (like C1, C2, etc.), while 
maintaining the computational complexity comparable to that of standard finite element computations.

As you might expect, the choice and number of the degrees of freedom depends on such continuity 
requirements. If mesh flexibility is the goal, while one is ready to  give up on global regularity, other approaches can be considered. For instance, dG approaches are naturally suited to deal with polytopic meshes. Here I present an extension of the classical Interior Penalty dG method which achieves optimal rates of convergence on polytopic meshes even under elemental edge/face degeneration. 

The next step is to exploit mesh flexibility in the efficient resolution of problems characterised by 
complicated geometries and solution features, for instance within the framework of automatic FEM 
adaptivity. I shall finally introduce ongoing work in this direction.

Erdos and Renyi introduced a model for studying random graphs of a given "density" and proved that there is a sharp threshold at which lower density random graphs are disconnected and higher density ones are connected.  Motivated by ideas in geometric group theory we will explain some new threshold theorems we have discovered for random graphs.  We will then, explain applications of these results to the geometry of Coxeter groups.  Some of this talk will be on joint work with Hagen and Sisto; other parts are joint work with Hagen, Susse, and Falgas-Ravry.

Form factors form a bridge between the purely on-shell amplitudes and the purely off-shell correlation functions. In this talk, we study the form factors of general gauge-invariant local composite operators in N=4 SYM theory via on-shell methods. At tree-level and for a minimalnumber of external fields, the form factor exactly realises the spin-chain picture of N=4 SYM theory in the language of scattering amplitudes. Via generalised unitarity, we obtain the cut-constructible part of the one-loop correction to the minimal form factor of a generic operator. Its UV divergence yields the complete one-loop dilatation operator of the theory. At two-loop order, we employ unitarity to calculate the minimal form factors and thereby the dilatation operator for the Konishi primary operator and all operators in the SU(2) sector. For the former operator as well as other non-protected operators, important subtleties arise which require an extension of the method of unitarity.

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.