Classification conjecture for complete partitions
Classification conjecture for complete partitions
Let be the family of partitions defined in the paper, and call a partition complete when it has the completeness property defined there.
Complete-partition classification conjecture. A partition is complete if and only if
The paper proves partial classification results and reports exhaustive numerical evidence for the associated characteristic- and score-sequence counts. The source gives no resolution of the full if-and-only-if statement.
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
Matthew Davis and Michael W. Schroeder, “Relating tournaments and permutations with xrays”, arXiv:2606.21532 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.