Anti-pencil conjecture for the maximum number of non-negative-sum subsets
Statement
Let be a set of real numbers with total sum zero, and let denote the number of -subsets of with non-negative sum. Let be the maximum of over all such sets .
Anti-pencil conjecture. If , then
The lower bound is attained by choosing exactly one negative element, yielding a -anti-pencil. Determining is described as a wide open problem, and the conjecture asserts optimality of this construction in the stated range.
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.