ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a poset and let GL(P)G_L(P) be its linear extension graph, whose vertices are the linear extensions of PP. The dimension dim⁡(P)\dim(P) is the minimum size of a realizer of PP, that is, a set of linear extensions whose intersection is PP.

Polynomial-time dimension conjecture. The dimension of a poset given its linear extension graph can be determined in polynomial time.

The proposition preceding this conjecture gives a quasi-polynomial-time algorithm, while the conjecture asks whether this can be improved to polynomial time. This would match the expected complexity suggested by the exponential size of a linear extension graph relative to the underlying poset.

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.