Classification conjecture for complete partitions

Less than 1 year old · traced to

Let Γ=Γ1∪Γ2∪Γ3\Gamma=\Gamma_1\cup\Gamma_2\cup\Gamma_3 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 λ\lambda is complete if and only if

λ∈Γ.\lambda\in\Gamma.

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.

References

Primary source

Matthew Davis and Michael W. Schroeder, “Relating tournaments and permutations with xrays”, arXiv:2606.21532 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.