ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M=(M,ρ){\cal M}=(M,\rho) be a finite pseudo-metric space and let G{\cal G} be a minimal filling of M{\cal M}. An exact tour is a tour whose associated boundary paths realize the corresponding distances and whose total length equals the weight of G{\cal G}.

Exact-tour conjecture. Every minimal filling possesses an exact tour.

Exact tours would provide a direct combinatorial certificate for the weight of a minimal filling and are used in the paper to relate minimal fillings to parametric fillings and tour lengths. The supplied passage gives an example of an unstable minimal parametric filling that nevertheless possesses an exact tour, but does not establish the conjecture in general.

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.