The crabbed-path strengthening for cocircuit distances
Statement
Let be a uniform oriented matroid, and let be cocircuits. Let denote the set used to define crabbed paths, and suppose . A path is crabbed from to when it satisfies the corresponding sign-coordinate restriction throughout.
Crabbed-path conjecture. There exists a crabbed path from to whose length is no bigger than the length of any path from to in .
This is presented as a strengthening of the London–Paris conjecture. The surrounding discussion explains that the related tope-path conjecture would imply a quadratic bound on polytope diameters, while the linear diameter conjecture is already refuted; the crabbed-path strengthening itself is not resolved in the paper.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.