Fyodorov–Keating conjecture on thick points of CUE characteristic polynomials

Let UNU_N be a random matrix distributed according to the Haar measure on the group of N×NN\times N unitary matrices, and let pN(θ)=det(1UNeiθ)p_N(\theta)=\det(1-U_N e^{-i\theta}) be its characteristic polynomial restricted to the unit circle {eiθ:θT}\{e^{i\theta}:\theta\in\mathbb{T}\}. Let GG denote the Barnes GG-function. Fyodorov–Keating conjecture. As NN\to\infty, for any 0<γ<10<\gamma<1, the random variable

12π02π1{logpN(θ)>γlogN}dθNγ21πlogNG(1+γ)22γG(1+2γ)1Γ(1γ2)\frac{\frac{1}{2\pi}\int_0^{2\pi}\mathbf{1}\{\log |p_N(\theta)|>\gamma\log N\}\,d\theta}{N^{-\gamma^2}\frac{1}{\sqrt{\pi\log N}}\frac{G(1+\gamma)^2}{2\gamma G(1+2\gamma)}\frac{1}{\Gamma(1-\gamma^2)}}

converges in distribution to a positive random variable with density

Pγ(x)=γ2x1γ2exγ21{x>0}.\mathcal{P}_\gamma(x)=\gamma^{-2}x^{-1-\gamma^{-2}}e^{-x^{-\gamma^{-2}}}\mathbf{1}\{x>0\}.

This conjecture exemplifies the expected universal connection between multiplicative chaos measures and fluctuations of thick points for logarithmically correlated fields. Results are known for several specific models, but identifying the law of this random variable in terms of Gaussian multiplicative chaos remains an open problem in the general setting.

Sources & referencesView supporting material

Primary source

Janne Junnila, Gaultier Lambert and Christian Webb, “Multiplicative chaos measures from thick points of log-correlated fields”, arXiv:2209.06548 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.