ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let μ(n)\mu(n) denote the minimum number of elements in a finite poset with exactly nn linear extensions. Kravitz–Sah conjecture.

μ(n)=O(log⁡n).\mu(n)=O(\log n).

This would improve the known bound μ(n)=O(log⁡n log⁡log⁡n)\mu(n)=O(\log n\,\log\log n) and would give substantially smaller posets realizing prescribed numbers of linear extensions.

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.