ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M=(M,ρ){\mathcal M}=(M,\rho) be a finite metric space. For a tree GG connecting MM, let O(M,G){\mathcal O}(M,G) be the set of tours of MM with respect to GG, and for each π∈O(M,G)\pi\in{\mathcal O}(M,G) define the half-perimeter by

p(M,G,π)=12∑x∈Mρ(x,π(x)).p({\mathcal M},G,\pi)=\frac{1}{2}\sum_{x\in M}\rho\bigl(x,\pi(x)\bigr).

Let mf⁡(M)\operatorname{mf}({\mathcal M}) denote the weight of a minimal filling. Ivanov–Tuzhilin hypothesis. For an arbitrary metric space M=(M,ρ){\mathcal M}=(M,\rho),

mf⁡(M)=min⁡Gmax⁡π∈O(M,G)p(M,G,π),\operatorname{mf}({\mathcal M})=\min_G\max_{\pi\in{\mathcal O}(M,G)}p({\mathcal M},G,\pi),

where the minimum is taken over all binary trees GG connecting MM. The formula proposes a tour-based characterization of minimal filling weight; the source attributes it to A. Ivanov and A. Tuzhilin and gives no resolution.

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.