Metraipolis › archive › dc_a3ef588cc6a7

Extremal expectations in card guessing with partial feedback: proofs of two conjectures of Diaconis-Graham-Spiro — arXiv:2609.25062

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25062
License (as archived)
CC0-1.0
Archived
2026-10-08T15:54:16.699Z
SHA-256 of the archived text
2c8ad051cff186a036c4530ec9351959e7be17f7015cf172cd51aa49ef1cfdc5
Stable URL of this page
https://metraipolis.com/documento/dc_a3ef588cc6a7

How to cite

Extremal expectations in card guessing with partial feedback: proofs of two conjectures of Diaconis-Graham-Spiro — arXiv:2609.25062 — arXiv (en), https://arxiv.org/abs/2609.25062 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a3ef588cc6a7 (Metraipolis archive dc_a3ef588cc6a7, sha256 2c8ad051cff186a036c4530ec9351959e7be17f7015cf172cd51aa49ef1cfdc5)
BibTeX
@misc{dca3ef588cc6a7,
  title = {Extremal expectations in card guessing with partial feedback: proofs of two conjectures of Diaconis-Graham-Spiro — arXiv:2609.25062},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25062},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a3ef588cc6a7; sha256 2c8ad051cff186a036c4530ec9351959e7be17f7015cf172cd51aa49ef1cfdc5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25062. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the minimum and maximum expected scores over all adaptive strategies in sequential card guessing with yes/no feedback. A deck contains $n$ labels, each appearing $m$ times, and is shuffled uniformly. The cards are guessed one at a time, and after each guess the player is told only whether it was correct. Always guessing the same label gives exactly $m$ points. How far can the expected score depart from $m$ if all previous feedback is used either to seek or to avoid correct guesses? Diaconis, Graham, and Spiro conjectured that the minimum expectation is $m-o(m)$ as $m\to\infty$ with $n$ sufficiently large in terms of $m$, and that, for each fixed $m$, the limit superior of the maximum expectation as $n\to\infty$ is at most $(e-1)m$. Writing these extrema as $P^-_{m,n}$ and $P^+_{m,n}$, we prove \[ 0\le m-P^-_{m,n}\le3m^{3/4} \qquad(n\ge m\ge1), \] and the finite-parameter bound \[ \frac{P^+_{m,n}}m\le\sum_{k=1}^{n}\frac1{k!}<e-1 \] for all positive integers $m,n$. The first bound gives a first-order asymptotic uniform in $n\ge m$; the universal constant $e-1$ in the second cannot be reduced. Thus both conjectures follow. The lower bound combines a switching comparison for restricted permutations with martingale second-moment estimates. For the upper bound, we represent the repeated cards as a random interleaving of independent decks of distinct cards and prove that the optimal expectation is additive when the component-deck labels are revealed.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.PR).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.25062 — 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-08T15:13:13.502Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).