ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a dd-dimensional polytope with nn facets, and let c{\bf c} be a generic linear functional. Orient the graph of PP according to increasing values of c{\bf c}, and denote this directed graph by G(P,c)G(P,{\bf c}). Its unique minimum and maximum vertices are called the source and sink, respectively. Strict Monotone Hirsch Conjecture. There is a directed path in G(P,c)G(P,{\bf c}) from the source of PP to the sink of PP of length at most n−dn-d. The conjecture concerns a monotone analogue of the Hirsch bound and is presented as a stronger condition related to the face nonrevisiting question; the supplied text gives no resolution.

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.