ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MT\mathrm{MT} be the space of merge trees, and let MTn⊆MT\mathrm{MT}_n\subseteq\mathrm{MT} denote the subspace of merge trees with at most nn leaves. For merge trees in this space, write (dI)^n\widehat{(d_I)}_n for the intrinsic metric induced by the interleaving distance, while d^I\widehat{d}_I and dId_I denote the unrestricted intrinsic and interleaving distances, respectively.

Restricted interleaving metric conjecture. When n=1,2n=1,2,

(dI)^n=d^I=dI.\widehat{(d_I)}_n=\widehat{d}_I=d_I.

When n>2n>2, there exist merge trees (T,f),(T′,f′)∈MTn(T,f),(T',f')\in\mathrm{MT}_n such that

(dI)^n((T,f),(T′,f′))>dI((T,f),(T′,f′)).\widehat{(d_I)}_n\big((T,f),(T',f')\big)>d_I\big((T,f),(T',f')\big).

This asks whether the subspace of merge trees with at most nn leaves is convex in the interleaving metric. The equality is known for n=1,2n=1,2, while for n>2n>2 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 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.