Deficient-score-sequence characterization of complete partitions

Less than 1 year old · traced to

Let λ\lambda be a partition, let λ′⊆λ\lambda'\subseteq\lambda denote a subpartition in the paper's sense, and let S2(λ′)\mathfrak{S}^2(\lambda') be the set of score sequences of 22-tournaments with shape λ′\lambda'. A sequence is deficient according to the paper's preceding definition.

Deficient-sequence characterization conjecture. A partition λ\lambda is complete if and only if, for every λ′⊆λ\lambda'\subseteq\lambda, the set S2(λ′)\mathfrak{S}^2(\lambda') has no deficient sequences:

S2(λ′) has no deficient sequences for all λ′⊆λ.\mathfrak{S}^2(\lambda')\text{ has no deficient sequences for all }\lambda'\subseteq\lambda.

The source states that this is equivalent to the complete-partition classification conjecture. The surrounding theorem gives partial implications, but the source gives no resolution of the conjecture.

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.