ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a finite poset that is not a chain. Consider two consecutive comparisons, and let t0=e(P)t_0=e(P), where e(P)e(P) is the number of linearizations of PP; let t1t_1 be the number of linearizations of the poset after the first comparison, and let t2t_2 be the number of linearizations after both comparisons. Gold Partition Conjecture. There are two consecutive comparisons such that, regardless of their results,

t0>t1+t2.t_0>t_1+t_2.

This conjecture implies the 1/3-2/3 conjecture. The source attributes it to Marcin Peczarski; the general conjecture remains open, despite being known through the implication and the many established cases of the 1/3-2/3 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.