Classification conjecture for complete partitions
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.