Peczarski's Gold Partition Conjecture for finite posets
Peczarski's Gold Partition Conjecture for finite posets
Let be a finite poset that is not a chain. Consider two consecutive comparisons, and let , where is the number of linearizations of ; let be the number of linearizations of the poset after the first comparison, and let be the number of linearizations after both comparisons. Gold Partition Conjecture. There are two consecutive comparisons such that, regardless of their results,
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
Sign in to submit a solution.
No solutions have been posted yet.