ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix an underlying discrete tree graph that is not a path graph. Let E\mathcal{E} be its edge set, let the positive edge-length vector lie in R+∣E∣\mathbb{R}^{|\mathcal{E}|}_{+}, and let M>0M>0. For the corresponding metric tree TT, let CT,MC_{T,M} 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 M>0M>0 for which the constant potential minimizes the spectral gap in CT,MC_{T,M} is of the first Baire category in

R+∣E∣×R+.\mathbb{R}^{|\mathcal{E}|}_{+}\times\mathbb{R}_{+}.

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