Peczarski's Gold Partition Conjecture for finite posets

From papers

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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Eric R. Dolores-Cuenca, Aldo Guzmán-Sáenz and Sangil Kim, “The gold partition conjecture and the Lexicographic sum of posets”, arXiv:2410.12494 (2024).

Solutions 0

No solutions have been posted yet.