Fyodorov–Keating conjecture on moments of regularized counting statistics
Fyodorov–Keating conjecture on moments of regularized counting statistics
Let be the regularized counting-statistics field and let . Define
For any such that , let denote the normalization constant appearing in the conjectured moment asymptotics, let be the Barnes -function, and set
Fyodorov–Keating conjecture.
This conjecture concerns the total mass of the exponential of the log-correlated field arising from regularized random-matrix counting statistics and is related to predictions for the extreme values of that field. The source states that, for , the conjecture remains an open problem; the row is therefore open.
Sources & referencesView supporting material
Primary source
Gaultier Lambert, Dmitry Ostrovsky and Nick Simm, “Subcritical multiplicative chaos for regularized counting statistics from random matrix theory”, arXiv:1612.02367 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.