Polynomial combinatorial-type conjecture for shortest paths on convex polyhedra
Statement
Let be the boundary of a convex polyhedron, and let a shortest path in have both endpoints in the interiors of facets. Its combinatorial type is the facet sequence traversed by .
Polynomial combinatorial-type conjecture. The cardinality of the set of combinatorial types of shortest paths in is polynomial in the number of facets of when the dimension is fixed.
This is stronger than the source-image conjecture because it does not fix one endpoint at a source point. The degree is expected to increase with the dimension, and the conjecture is known when the boundary has dimension ; the general case remains open.
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.