ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (X,d)(X,d) be a finite metric space. Its tight-span T(d)T(d) is the polytopal complex of minimal elements, under the product order, of

P(d):={f∈RX:f(x)+f(y)≥d(x,y) for all x,y∈X}.P(d):=\{f\in\mathbb{R}^{X}:f(x)+f(y)\geq d(x,y)\text{ for all }x,y\in X\}.

Let GdG_d be the weighted graph consisting of the zero- and one-dimensional faces of T(d)T(d), with edge weights w∞({f,g})=d∞(f,g)w_\infty(\{f,g\})=d_\infty(f,g), where d∞(f,g)=sup⁡x∈X∣f(x)−g(x)∣d_\infty(f,g)=\sup_{x\in X}|f(x)-g(x)|. An optimal realisation of (X,d)(X,d) is a weighted graph whose shortest-path distances on XX equal dd and whose total edge weight is minimal among all such realisations. Dress's tight-span realisation conjecture. There exists an optimal realisation of (X,d)(X,d) that is homeomorphic to a subgraph of (Gd,w∞)(G_d,w_\infty). Dress showed that GdG_d itself is homeomorphic to a realisation of (X,d)(X,d), but the assertion that every optimal realisation has this property was disproved by Althöfer; the existence of at least one such optimal realisation remains open.

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.