The principal ideal theorem (1930) ascertained that any number field K embeds into a finite extension, called the Hilbert class field of K, in which every ideal of the original field became principal -- however the Hilbert class field itself will not necessarily have class number 1. The class field tower problem asked whether iteratively taking Hilbert class fields must stabilize after finitely many steps. In 1964, it was finally answered in the negative by Golod and Shafarevich who produced infinitely many examples and pioneered the framework that is still the most common setting for deciding when a number field will have an infinite class field tower.

In this talk, I will sketch the proof of their cohomological result and explain how it settled the class field tower problem.

A particularly active area of research in modern algebraic number theory is the study of a class of numbers, called periods. In their simplest form, periods are integrals of rational functions over domains defined by rational in equations. They form a ring, which encompasses all algebraic numbers, logarithms thereof and \pi. They arise in the study of modular forms, cohomology and quantum field theory, and conjecturally have a sort of Galois theory.

We will take a whirlwind tour of these numbers, before discussing non-periods. In particular, we will sketch the construction of an explicit non-period, often forgotten about.

L-functions have become a vital part of modern number theory over the past century, allowing comparisons between arithmetic objects with seemingly very different properties. In the first part of this talk, I will give an overview of where they arise, their properties, and the mathematics that has developed in order to understand them. In the second part, I will give a sketch of the beautiful result of Herbrand-Ribet concerning the arithmetic interpretations of certain special values of the Riemann zeta function, the prototypical example of an L-function.

Let $[N] = \{1,..., N\}$ and let $A$ be a subset of $[N]$. A result of Sárközy in 1978 showed that if the difference set $A-A = \{ a - a’: a, a’ \in A\}$ does not contain any number which is one less than a prime, then $A = o(N)$. The quantitative upper bound on $A$ obtained from Sárközy’s proof has be improved subsequently by Lucier, and by Ruzsa and Sanders. In this talk, I will discuss my work on this problem. I will give a brief introduction of the iteration scheme and the Hardy-Littlewood method used in the known proofs, and our major arc estimate which leads to an improved bound.

A subset of the integers larger than 1 is called $\textit{primitive}$ if no member divides another. Erdős proved in 1935 that the sum of $1/(n \log n)$ over $n$ in a primitive set $A$ is universally bounded for any choice of $A$. In 1988, he famously asked if this universal bound is attained by the set of prime numbers. In this talk we shall discuss some recent progress towards this conjecture and related results, drawing on ideas from analysis, probability, & combinatorics.

I will be talking of recent results by Ayse Berkman and myself, as well as about a more general program of research in this area.

I will present joint work with A. Pillay on the theory of NIP formulas in arbitrary groups, which exhibit a local formulation of the notion of finitely satisfiable generics (as defined by Hrushovski, Peterzil, and Pillay). This setting generalizes ``local stable group theory" (i.e., the study of stable formulas in groups) and also the case of arbitrary NIP formulas in pseudofinite groups. Time permitting, I will mention an application of these results in additive combinatorics.

I will elaborate on some recent developments on the theory of special functions which are relevant to the calculation of Feynman integrals in perturbative quantum field theory, highlighting the connections with some recent ideas in pure mathematics.