ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an nn-dimensional poset poly-antimatroid be an nn-dimensional poly-antimatroid that is closed under intersection, and let its convex dimension be the minimum number of chains whose unions describe the poly-antimatroid.

Convex-dimension bound conjecture. The convex dimension of an nn-dimensional poset poly-antimatroid is at most nn.

This would generalize the preceding three-dimensional consequence from the proposed staircase characterization. The source provides no resolution of this conjecture.

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.