The tour formula for minimal filling weight

For a pseudo-metric space M=(M,ρ){\cal M}=(M,\rho), let mf(M)\operatorname{mf}({\cal M}) be the weight of a minimal filling. For a tree GG with boundary MM, let O(G){\cal O}(G) be its tours and let p(M,π)p({\cal M},\pi) be the perimeter associated with a tour π\pi.

Minimal-filling tour formula. For an arbitrary pseudo-metric space M=(M,ρ){\cal M}=(M,\rho),

mf(M)=minGmaxπO(G)p(M,π),\operatorname{mf}({\cal M})=\min_G\max_{\pi\in{\cal O}(G)}p({\cal M},\pi),

where the minimum may be taken over all trees with boundary MM, or equivalently over all binary trees with boundary MM.

The paper says this formula follows from the two preceding conjectures, so it is a conjectural consequence rather than an independently established theorem in the supplied passage. It would give a formula for calculating the weight of a minimal filling for every pseudo-metric space.

Sources & referencesView supporting material

Primary source

A. O. Ivanov and A. A. Tuzhilin, “One-dimensional Gromov minimal filling”, arXiv:1101.0106 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.