ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P=(X,≤)P=(X,\le) be a finite partially ordered set, so that ≤\le is a reflexive, antisymmetric, transitive binary relation on the finite set XX. A linear extension of PP is a total order ⪯\preceq on XX such that x≤yx\le y implies x⪯yx\preceq y for all x,y∈Xx,y\in X. Let L(P)\mathcal{L}(P) denote the set of linear extensions of PP, and for x,y∈Xx,y\in X put

pP(x,y)=∣{⪯ ∈L(P)  :  x≺y}∣∣L(P)∣,p_P(x,y)=\frac{\bigl|\{\preceq\,\in\mathcal{L}(P)\;:\;x\prec y\}\bigr|}{|\mathcal{L}(P)|},

the proportion of linear extensions of PP in which xx precedes yy.

Suppose PP is not a total order, i.e. there exist x,y∈Xx,y\in X with x≠yx\ne y, x≰yx\not\le y and y≰xy\not\le x. Then there exists a pair of elements x,y∈Xx,y\in X with

13  ≤  pP(x,y)  ≤  23.\tfrac13\;\le\;p_P(x,y)\;\le\;\tfrac23 .

Equivalently, setting

δ(P)=max⁡x,y∈X min⁡{pP(x,y), 1−pP(x,y)},\delta(P)=\max_{x,y\in X}\ \min\bigl\{p_P(x,y),\,1-p_P(x,y)\bigr\},

every finite partially ordered set PP that is not a total order satisfies δ(P)≥13\delta(P)\ge \tfrac13.

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.