Gnutzmann–Smilansky–Weber universal nodal-surplus Gaussian conjecture
Gnutzmann–Smilansky–Weber universal nodal-surplus Gaussian conjecture
Let be any sequence of standard graphs parameterized by their first Betti numbers, with each graph having rationally independent edge lengths. Let be the corresponding nodal surplus random variable. Gnutzmann–Smilansky–Weber's conjecture.
where the convergence is in distribution and
This is the universal formulation of the nodal-statistics conjecture in terms of nodal surplus. The source proves it for trees of cycles, while the assertion for arbitrary such graph sequences remains open.
Sources & referencesView supporting material
Primary source
Lior Alon, “Quantum graphs – Generic eigenfunctions and their nodal count and Neumann count statistics”, arXiv:2010.03004 (2020).
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.