Past Events

Christol's theorem (1979), which sets ground for many interactions between theoretical computer science and number theory, characterizes the coefficients of a formal power series over a finite field of positive characteristic $p>0$ that satisfy an...

We show that the reduction of a projective endomorphism modulo a discrete valuation naturally takes the form of a set-theoretic correspondence. This raises the possibility of classifying "reduction types" of such dynamical systems, reminiscent of the...

A longstanding conjecture of Carleson stated that the tangent points of the boundaries of certain planar domains can be characterized by the behavior of the Carleson ε-function. This conjecture, which was fully resolved by Jaye, Tolsa, and Villa in...

The mixing time and spectral gap of a random walk on the symmetric group can sometimes be understood in terms of its low dimensional representations (e.g., Aldous' spectral gap conjecture). It turns out that under a mild degree condition involving...

The Polya group of a number field K is a specific subgroup of the ideal class group Cl(K) of K, generated by all classes of Ostrowski ideals of K. In this talk, I will discuss the equality Po(K)=Cl(K) in two directions. First, we will see this...

Tensors are higher-dimensional generalisations of matrices, and likewise the main notion of complexity on matrices - their rank - may be extended to tensors. Unlike in the matrix case however, there is no single canonical notion of rank for tensors...

TBA

I will provide an introduction to simplicial sets, which will serve as foundation for the rest of the lecture series. We will discuss examples and a few constructions, such as the function complex and geometric realization.

For every finite group H and every finite H-module A, we determine the subgroup of negligible classes in H^2(H,A), in the sense of Serre, over fields with enough roots of unity. As a consequence, we show that for every odd prime p and every field F...

We will explore how a Fourier optimization framework may be used to study two classical problems in number theory involving Dirichlet characters: The problem of estimating the least character non-residue; and the problem of estimating the least prime...