The conjecture of Q-independent spectrum for metric graphs
Statement
Let be a metric graph with edges and edge-length vector . Write the non-zero square-root eigenvalues in increasing order as
-independent spectrum conjecture. For every graph , possibly except for some pathological cases, there is a generic set such that, for every , the spectrum is linearly independent over . Equivalently, for every and every ,
Kurasov and Sarnak established that the spectrum has infinite dimension over when the edge lengths are -independent; the conjecture asks for full linear independence for generic edge lengths. The source presents this as future work and gives no resolution.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.