The restricted interleaving metric conjecture for merge trees
Statement
Let be the space of merge trees, and let denote the subspace of merge trees with at most leaves. For merge trees in this space, write for the intrinsic metric induced by the interleaving distance, while and denote the unrestricted intrinsic and interleaving distances, respectively.
Restricted interleaving metric conjecture. When ,
When , there exist merge trees such that
This asks whether the subspace of merge trees with at most leaves is convex in the interleaving metric. The equality is known for , while for the conjecture predicts that the restricted intrinsic metric can be strictly larger than the ambient interleaving distance.
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.