SearcharxivSearch

arXiv · 2511.06145

Extremal poker hand rankings: why the standard 52 card deck and a 3044 card deck are special

Abstract

We study poker hand rankings in the partially generalised setting of a deck with $r$ ranks, rather than the typical 13 ranks. We provide the hand rankings for all $r$ and observe some interesting phenomena such as the smallest $r$ such that flushes rank below one-pair hands. Perhaps surprisingly, as $r$ grows without bound, the hand ranking is not stable until $r=761$ (a 3044 card deck). We consider showdown frequency, which is the frequency that a given type of hand is declared by a player at showdown, and make note of counterintuitive instances in which a hand with lower absolute frequency than some other hand nonetheless has a higher showdown frequency. This can be interpreted as a form of Gadbois paradox but in the typical setting of poker without wild cards. Conveniently, the standard deck with 13 ranks turns out to be the smallest deck that avoids a discrepancy between absolute frequency and showdown frequency for all hand types other than having a high card.

Explore related subjects

Keep this discovery

BibTeXRIS

Christopher Williamson. 2025-11-08. Extremal poker hand rankings: why the standard 52 card deck and a 3044 card deck are special. https://arxiv.org/abs/2511.06145

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO