I describe joint work with Alastair Irving in which we improve a result of
D.H.J. Polymath on the length of intervals in $[N,2N]$ that can be shown to
contain $m$ primes. Here $m$ should be thought of as large but fixed, while $N$
tends to infinity.
The Harman sieve is the key to the improvement. The preprint will be
available on the Math ArXiv before the date of the talk.

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.

Suppose that we have a tile $T$ in say $\mathbb{Z}^2$, meaning a finite subset of $\mathbb{Z}^2$. It may or may not be the case that $T$ tiles $\mathbb{Z}^2$, in the sense that $\mathbb{Z}^2$ can be partitioned into copies of $T$. But is there always some higher dimension $\mathbb{Z}^d$ that can be tiled with copies of $T$? We prove that this is the case: for any tile in $\mathbb{Z}^2$ (or in $\mathbb{Z}^n$, any $n$) there is a $d$ such that $\mathbb{Z}^d$ can be tiled with copies of it. This proves a conjecture of Chalcraft.