Equitable partition conjecture for prescribed block sizes
Statement
Let , let be an integer, and let a partition of implement when its blocks can be bijectively matched with the prescribed sizes . Call a partition equitable when every block has sum . Let be positive integers, let with , and set . Equitable partition conjecture. There exists an equitable partition of implementing if and only if
for every . This conjecture asserts sufficiency of the stated necessary condition for equal-sum partitions with prescribed block sizes; the supplied source gives no resolution evidence.
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.