The zero-partition maximization conjecture
Statement
For and , a zero partition of is a choice of signs such that . Zero-partition maximization conjecture. If is even, the number of zero partitions of is at most the number for , namely
If is odd, it is at most the number for a vector whose entries are all except one entry equal to . The conjecture proposes extremal bounds for zero-sum sign assignments, but the supplied text gives no resolution or further context.
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.