The card guessing game: a generating function approach
From MaRDI portal
Publication:2673994
DOI10.1016/j.jsc.2022.07.001zbMath1496.91036arXiv2107.11142OpenAlexW3185994529WikidataQ113869795 ScholiaQ113869795MaRDI QIDQ2673994
Tipaluck Krityakierne, Thotsaporn ``Aek Thanatipanonda
Publication date: 22 September 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.11142
Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Combinatorial games (91A46) Probabilistic games; gambling (91A60)
Related Items (5)
Online card games ⋮ Moments of the one-shuffle no-feedback card guessing game ⋮ Order bounds for C2-finite sequences ⋮ On card guessing games: limit law for no feedback one-time riffle shuffle ⋮ Card guessing and the birthday problem for sampling without replacement
Uses Software
Cites Work
- The method of creative telescoping
- Trailing the dovetail shuffle to its lair
- No-feedback card guessing for dovetail shuffles
- On card guessing game with one time riffle shuffle and complete feedback
- The Automatic Central Limit Theorems Generator (and Much More!)
- Proofs from THE BOOK
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The card guessing game: a generating function approach