ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n,k∈Nn,k\in\mathbb N and d∈(0,1)d\in(0,1). In the KR-Problem, choose nonnegative numbers a1,…,ana_1,\ldots,a_n with ∑i=1nai=1\sum_{i=1}^n a_i=1 to maximize the probability that the sum over a uniformly random kk-element subset exceeds dd. Kikuta–Ruckle conjecture. For every n,k∈Nn,k\in\mathbb N and d∈(0,1)d\in(0,1), there is an optimal solution of the form

a1=⋯=as=1s,as+1=⋯=an=0a_1=\cdots=a_s=\frac1s,\qquad a_{s+1}=\cdots=a_n=0

for some s∈{1,2,…,n}s\in\{1,2,\ldots,n\}. The conjecture is described as a central claim for the generalized problem; the source gives no resolution.

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.