Metraipolis › archive › dc_4bad737bf326

Dice enterprises and polynomial approximation: uniform query tails — arXiv:2610.38964

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38964
License (as archived)
CC0-1.0
Archived
2026-11-01T02:34:15.007Z
SHA-256 of the archived text
429cae1c58c7611ebe2b65c7052833314a24a8712ff3b40898c6f35eb7dd6caa
Stable URL of this page
https://metraipolis.com/documento/dc_4bad737bf326

How to cite

Dice enterprises and polynomial approximation: uniform query tails — arXiv:2610.38964 — arXiv (en), https://arxiv.org/abs/2610.38964 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4bad737bf326 (Metraipolis archive dc_4bad737bf326, sha256 429cae1c58c7611ebe2b65c7052833314a24a8712ff3b40898c6f35eb7dd6caa)
BibTeX
@misc{dc4bad737bf326,
  title = {Dice enterprises and polynomial approximation: uniform query tails — arXiv:2610.38964},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38964},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4bad737bf326; sha256 429cae1c58c7611ebe2b65c7052833314a24a8712ff3b40898c6f35eb7dd6caa},
  year = {2026}
}

Archived text

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

A binary-output dice enterprise uses independent rolls of a die with unknown face probabilities $\mathbf p$ (along with fair coin flips) to simulate a coin with bias $f(\mathbf p)$. We determine which power-law tails, uniform over the closed probability simplex, are attainable for the number $N$ of rolls. For continuous $f$ with values in $(0,1)$ and $q>0$, some enterprise for $f$ satisfies $\sup_{\mathbf p}\mathbb{P}_{\mathbf p}(N>n)=O(n^{-q})$ if and only if $f$ can be approximated uniformly by polynomials of degree $k$ with error $O(k^{-2q})$. When this holds, the same tail bound is attained by an oblivious enterprise, which chooses its number of rolls before rolling. The characterization extends to multiple dice, with total degree on a product of simplices; it then suffices to roll the dice in a fixed cyclic order. For $q>1$, these enterprises have a uniformly bounded expected number of rolls.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.38964 — 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-11-01T02:14:58.630Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).