10.00-11:00
|
Daniel Fiorilli
|
Variance of arithmetic sequences in arithmetic progressions |
I will discuss some recent work with de la Bretèche on the variance of divisor functions in progressions as well as some of my past work on Hooley's conjecture on primes in progressions. I will show how these questions are linked with random matrix theory as well as large deviations of random variables.
|
11.30-12:30
|
Adam Harper
|
The partition function of the Riemann zeta function |
One can form a "partition function" from the Riemann zeta function by looking at integrals of powers of zeta over short intervals. A particularly interesting case, which turns out to be closely connected to critical multiplicative chaos, is that of short integrals of the mean square of zeta. I will describe how one can obtain sharp upper bounds for the low moments of this partition function, and the consequences for the maximum of zeta in short intervals.
|
2.00-3:00
|
Joseph Najnudel
|
On the maximum of two log-correlated fields: the
logarithms of the characteristic polynomial of the
Circular Beta Ensemble and the Riemann zeta
function. Slides |
For different random fields whose correlation is logarithmic with respect to the distance between the points, we observe similar behavior for their extreme values, either proven or conjectured, depending on the model. In this talk, we present two different examples of such fields: the logarithm of the characteristic polynomial of the Circular Beta Ensemble (an ensemble of random unitary matrices generalizing the Circular Unitary Ensemble), and the logarithm of the Riemann zeta function, on a random interval of the critical line.
|
3.30-4:30
|
Reda Chhaibi
|
On the circle, Kahane's Gaussian Multiplicative Chaos and the Circular Beta Ensemble match exactly. Slides |
In this talk, I would like to advertise an equality between two objects from rather different areas of mathematical physics. This bridges the Gaussian Multiplicative Chaos, which plays an important role in certain conformal field theories, and a reference model in random matrices, the CBE (Circular Beta Ensemble). The main tool is an explicit description of canonical moments aka Verblunsky coefficients.
On the one hand, in 1985, J.P Kahane introduced a random measure called the Gaussian Multiplicative Chaos (GMC). Morally, this is the measure whose Radon-Nikodym derivative w.r.t to Lebesgue is the exponential of a log correlated Gaussian field. In the cases of interest, this Gaussian field is a Schwartz distribution but not a function. As such, the construction of GMC needs to be done with care. In particular, in 2D, the GFF (Gaussian Free Field) is a random Schwartz distribution because of the logarithmic singularity of the Green kernel in 2D. Here we are interested in the 1D case on the circle.
On the other hand, it is known since Verblunsky (1930s) that a probability measure on the circle is entirely determined by the coefficients appearing in the recurrence of orthogonal polynomials. Furthermore, Killip and Nenciu (2000s) have given a realization of the CBE, an important model in random matrices, thanks to random orthogonal polynomials of the circle.
I will give the precise statement whose loose form is CBE = GMC modulo a relation between the coupling constant \beta in the CBE and the coupling constant of GMC.
|