ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a quantum graph be a metric graph with edge lengths, and let the nodal domains of an eigenfunction be the connected components of the complement of its zero set. Consider well-connected graphs with incommensurate bond lengths, and the distribution of their nodal-domain counts in the previously specified bounded interval. Gnutzmann–Smilansky–Weber's conjecture. As the number of vertices tends to infinity, this distribution approaches a Gaussian distribution.

This is a universality conjecture for nodal statistics in quantum graphs. The source later proves a related Gaussian limit for a particular family, but does not establish this general formulation.

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.