Dress's tight-span realisation conjecture
Statement
Let be a finite metric space. Its tight-span is the polytopal complex of minimal elements, under the product order, of
Let be the weighted graph consisting of the zero- and one-dimensional faces of , with edge weights , where . An optimal realisation of is a weighted graph whose shortest-path distances on equal and whose total edge weight is minimal among all such realisations. Dress's tight-span realisation conjecture. There exists an optimal realisation of that is homeomorphic to a subgraph of . Dress showed that itself is homeomorphic to a realisation of , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.