ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let epsilon>0epsilon>0. A doubly connected metric graph is a graph of the type specified in the paper's location discussion. Let diam⁡gamma\operatorname{diam}gamma denote its diameter, μ2(gamma)\mu_2(gamma) its second eigenvalue, and MM its hot-spot set.

Close hot-spots conjecture. For every epsilon>0epsilon>0, there exists a doubly connected graph gammagamma such that

diam⁡gamma=1,\operatorname{diam}gamma=1,

mu2(gamma)mu_2(gamma) is simple, and

max{dist⁡(x,y):x,y∈M}<epsilon.{\text{\rm max}}\{\operatorname{dist}(x,y):x,y\in M\}<epsilon.

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 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.