Metraipolis › archive › dc_c8c2ff5dafa7
A Cap-Move Reformulation of Ling's Proof of Samuels' Conjecture — arXiv:2608.22816
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22816
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:36:03.164Z
- SHA-256 of the archived text
98f8129d6d674ea81e824c39b16baf5d7af675c5f7ede65ea877bc0f8501af24- Stable URL of this page
https://metraipolis.com/documento/dc_c8c2ff5dafa7
How to cite
A Cap-Move Reformulation of Ling's Proof of Samuels' Conjecture — arXiv:2608.22816 — arXiv (en), https://arxiv.org/abs/2608.22816 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c8c2ff5dafa7 (Metraipolis archive dc_c8c2ff5dafa7, sha256 98f8129d6d674ea81e824c39b16baf5d7af675c5f7ede65ea877bc0f8501af24)
BibTeX
@misc{dcc8c2ff5dafa7,
title = {A Cap-Move Reformulation of Ling's Proof of Samuels' Conjecture — arXiv:2608.22816},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22816},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c8c2ff5dafa7; sha256 98f8129d6d674ea81e824c39b16baf5d7af675c5f7ede65ea877bc0f8501af24},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22816. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $0\le \mu_1\le \mu_2 \le \cdots \le \mu_n$ and $\delta > 0$. Samuels' conjecture claims that if $X_1,\dots,X_n$ are independent non-negative random variables with $\mathbb{E}[X_i] = \mu_i$, then $$ \mathbb{P}\left( \sum_{i=1}^n X_i < \delta + \sum_{i=1}^n \mu_i \right) \ge \min_{1\le i\le n} \prod_{j=i}^n \left(1-\frac{\mu_j}{\delta + \sum_{k=i}^n \mu_k}\right).$$ This conjecture was recently proved by Ling. In this note, we provide an alternative presentation of Ling's proof via an operation called the \emph{cap move}. This proof works directly with finitely supported distributions and avoids the reduction to the Bernoulli case.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.22816 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:27:54.477Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).