ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let hh be a generic real symmetric matrix in S(G){\mathcal S}(G). Let h′h' be a random signing of hh, and let σ(h′,k)\sigma(h',k) denote the nodal surplus of the kk-th eigenfunction. For a sequence of graphs and matrices (Gj,hj)(G_j,h_j) with first Betti numbers β(Gj)→∞\beta(G_j)\to\infty, define

Σ(h′,k):=σ(h′,k)−E(σ(h′,k))std(σ(h′,k)).\Sigma(h',k):=\frac{\sigma(h',k)-\mathbb{E}(\sigma(h',k))}{\mathrm{std}(\sigma(h',k))}.

Uniform Gaussian nodal surplus conjecture. One should have

sup⁡kdistKS(Σ(hj′,k),N(0,1))⟶0,\sup_k \mathrm{dist}_{KS}\left(\Sigma(h_j',k),N(0,1)\right)\longrightarrow 0,

where distKS\mathrm{dist}_{KS} is the Kolmogorov–Smirnov distance and N(0,1)N(0,1) is the standard normal distribution. This is a refinement of the earlier random-signing-and-random-index conjecture: it keeps kk fixed while taking the distribution over signings, uniformly in kk. The source reports numerical evidence for the claim, while its status is not otherwise resolved in the supplied context.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.