ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be a set of nn real numbers with total sum zero, and let μk(A)\mu_k(A) denote the number of kk-subsets of AA with non-negative sum. Let μmax⁡(k,n)\mu_{\max}(k,n) be the maximum of μk(A)\mu_k(A) over all such sets AA.

Anti-pencil conjecture. If n≥4kn\geq 4k, then

μmax⁡(k,n)=(n−1k).\mu_{\max}(k,n)=\binom{n-1}{k}.

The lower bound is attained by choosing exactly one negative element, yielding a kk-anti-pencil. Determining μmax⁡(k,n)\mu_{\max}(k,n) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.