ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every finite poset PP with n=∣P∣n=|P|, determine the facet-count gap gap⁡(P):=fn−1(C(P))−fn−1(O(P))\operatorname{gap}(P):=f_{n-1}(C(P))-f_{n-1}(O(P)), where O(P)O(P) and C(P)C(P) are respectively the order and chain polytopes of PP. In particular, seek a structural determination, classification, and sharp bounds for gap⁡(P)\operatorname{gap}(P) beyond the known inequality fn−1(O(P))≤fn−1(C(P))f_{n-1}(O(P))\leq f_{n-1}(C(P)). The analogous problem for the facet differences between admissible decompositions of marked chain--order polytopes is also included.

Record

Added
Links

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.