ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be the boundary of a convex polyhedron, and let a shortest path γ\gamma in SS have both endpoints in the interiors of facets. Its combinatorial type is the facet sequence Lγ\mathcal L_\gamma traversed by γ\gamma.

Polynomial combinatorial-type conjecture. The cardinality of the set of combinatorial types of shortest paths in SS is polynomial in the number of facets of SS 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 22; 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 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.