Doubly connected graphs with arbitrarily close hot spots conjecture
Statement
Let . A doubly connected metric graph is a graph of the type specified in the paper's location discussion. Let denote its diameter, its second eigenvalue, and its hot-spot set.
Close hot-spots conjecture. For every , there exists a doubly connected graph such that
is simple, and
This shows that even without a tree-like boundary structure, the hot spots may be arbitrarily close relative to the graph diameter. The source gives no resolution status.
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.