ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an optimizer of the mailing problem in branched transportation, does it have finite graph structure in every ball outside the supports of the initial and target measures, and is the number of branches at a branching point uniformly bounded?

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.