University of Warwick

Abstract: A diffusion process on a Riemannian manifold whose generator is one half of the Laplacian is called a Brownian motion. The mean local time of Brownian motion on a hypersurface will be considered, as will the situation in which a Brownian motion is conditioned to arrive in a fixed submanifold at a fixed positive time. Doing so provides motivation for the remainder of the talk, in which a probabilistic formula for the integral of the heat kernel over a submanifold is proved and used to deduce lower bounds, an asymptotic relation and derivative estimates applicable to the conditioned process.

Abstract: Joint work with Oleg Zaboronsky (Warwick).

Some one dimensional nearest neighbour particle systems are examples of Pfaffian point processes - where all intensities are determined by a single kernel.In some cases these kernels have appeared in the random matrix literature (where the points are the positions of eigenvalues). We are attempting to use random matrix tools on the particle sytems, and particle tools on the random matrices.

In 1851, Carl Jacobi made the experimental observation that all integers are sums of seven non-negative cubes, with precisely 17 exceptions, the largest of which is 454. Building on previous work by Maillet, Landau, Dickson, Linnik, Watson, Bombieri, Ramaré, Elkies and many others, we complete the proof of Jacobi's observation.

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.

Tropicalization replaces a variety by a polyhedral complex that is a "combinatorial shadow" of the original variety.  This allows algebraic geometric problems to be attacked using combinatorial and
polyhedral techniques.  While this idea has proved surprisingly effective over the last decade, it has so far been restricted to the study of varieties and algebraic cycles.  I will discuss joint work with Felipe Rincon, building on work of Jeff and Noah Giansiracusa, to understand tropicalizing schemes, and more generally the concept of a tropical scheme.

The Cohen-Lenstra heuristics, postulated in the early 80s, conceptually explained numerous phenomena in the behaviour of ideal class groups of number fields that had puzzled mathematicians for decades, by proposing a probabilistic model: the probability that the class group of an imaginary quadratic field is isomorphic to a given group $A$ is inverse proportional to $\#\text{Aut}(A)$. This is a very natural model for random algebraic objects. But the probability weights for more general number fields, while agreeing well with experiments, look rather mysterious. I will explain how to recover the original heuristic in a very conceptual way by phrasing it in terms of Arakelov class groups instead. The main difficulty that one needs to overcome is that Arakelov class groups typically have infinitely many automorphisms. We build up a theory of commensurability of modules, of groups, and of rings, in order to remove this obstacle. This is joint work with Hendrik Lenstra.

I will describe joint work with Manjul Bhargava (Princeton) and Tom Fisher (Cambridge) in which we determine the probability that random equation from certain families  has a solution either locally (over the reals or the p-adics), everywhere locally,  or globally. Three kinds of equation will be considered: quadratics in any number of variables, ternary cubics and hyperelliptic quartics.