Samuels's conjecture on sums of independent nonnegative random variables

From papers

Let 0μ1μl0\le\mu_1\le\cdots\le\mu_l with i=1lμi<1\sum_{i=1}^l\mu_i<1. Define

P(μ1,,μl)=infP(X1++Xl<1),P(\mu_1,\ldots,\mu_l)=\inf\mathbb{P}(X_1+\cdots+X_l<1),

where the infimum is over independent nonnegative random variables XiX_i with expectations EXi=μi\mathbb{E}X_i=\mu_i, and define

Qt(μ1,,μl)=i=t+1l(1μi1j=1tμj),0t<l.Q_t(\mu_1,\ldots,\mu_l)=\prod_{i=t+1}^l\left(1-\frac{\mu_i}{1-\sum_{j=1}^t\mu_j}\right),\qquad 0\le t<l.

Samuels's conjecture. For all admissible values of μ1,,μl\mu_1,\ldots,\mu_l,

P(μ1,,μl)=mint=0,,l1Qt(μ1,,μl).P(\mu_1,\ldots,\mu_l)=\min_{t=0,\ldots,l-1}Q_t(\mu_1,\ldots,\mu_l).

This probabilistic conjecture underlies the paper's treatment of fractional matching thresholds; the source does not state a general resolution, so it remains open here.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Noga Alon, Peter Frankl, Hao Huang, Vojtech Rodl, Andrzej Rucinski and Benny Sudakov, “Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels”, arXiv:1107.1219 (2012).

Solutions 0

No solutions have been posted yet.