Generic non-optimality of constant potentials on non-path metric trees
Statement
Fix an underlying discrete tree graph that is not a path graph. Let be its edge set, let the positive edge-length vector lie in , and let . For the corresponding metric tree , let denote the class of convex potentials under consideration, and let the spectral gap be the difference between the first two eigenvalues.
Generic non-optimality conjecture. The set of edge-length vectors and values for which the constant potential minimizes the spectral gap in is of the first Baire category in
The claim concerns the generic behavior of convex-potential gap minimization on metric trees and asserts that constant potentials are exceptional for every underlying tree that is not a path graph. The source presents it as a conjecture; no resolution is supplied.
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.