ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 0≤c1≤⋯≤cl0\leq c_1\leq\cdots\leq c_l with ∑i=1lci<1\sum_{i=1}^l c_i<1. Consider ll independent non-negative random variables X1,…,XlX_1,\ldots,X_l satisfying E[Xi]=ci\mathbf E[X_i]=c_i. Let kk be an integer, let βj\beta_j be Bernoulli random variables for j>kj>k, and set

b=∑i=1kci.b=\sum_{i=1}^k c_i.

Samuels' conjecture. The supremum of P(X1+⋯+Xl≥1)\mathbf P(X_1+\cdots+X_l\geq1) over all such collections is a maximum attained by Xj=cjX_j=c_j for j≤kj\leq k and Xj=(1−b)βjX_j=(1-b)\beta_j for j>kj>k.

The conjecture predicts that an optimizer accumulates the smaller expectations deterministically before switching to bold play. The source presents it as an open conjecture and notes that, when all expectations are equal, it predicts optimization by a binomial.

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.