The GOE nodal-count central limit conjecture

From papers

Let AA be a random n×nn\times n matrix drawn from the Gaussian Orthogonal Ensemble. For fixed kk, define the normalized nodal count by

ϕ(A,k):=ϕ(A,k)E[ϕ(A,k)]Var(ϕ(A,k)).\overline{\phi(A,k)}:=\frac{\phi(A,k)-\mathbb{E}[\phi(A,k)]}{\sqrt{\mathrm{Var}(\phi(A,k))}}.

GOE nodal-count central limit conjecture. For every k[n]k\in[n],

dist(ϕ(A,k),N(0,1))=o(1),\mathrm{dist}\left(\overline{\phi(A,k)},N(0,1)\right)=o(1),

as nn grows, uniformly in kk, for any reasonable distance between random variables. The conjecture concerns Gaussian fluctuations of GOE nodal counts; the paper reports numerical evidence but does not provide a proof in the supplied text.

Progress summary

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

Sources & referencesView supporting material

Primary source

Lior Alon, Dan Mikulincer and John Urschel, “Nodal Count for Orthogonally Invariant Ensembles”, arXiv:2511.02784 (2025).

Solutions 0

No solutions have been posted yet.