Distance-set rigidity conjecture for finite GH-spaces generated by labeled trees
Statement
Let and let be finite labeled trees with non-degenerate labelings . Suppose that and are -spaces. For a space , let denote its distance set. Distance-set rigidity conjecture. The following statements are equivalent:
- .
- and are isometric.
The implication from isometry to equality of distance sets is immediate, and the converse is known when both trees have at most three vertices; the general case 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.