Fair Dice — The Aequi: Enumerating the Innumerable

A die is fair in the solid-angle model when every face, seen from the centre, fills the same share 4π/N of the sky. Fair dice are innumerable: every choice of face directions gives a new problem. We show that one rule covers them all. Through the polar body, the solid angle of a face is the integral Gauss curvature at the matching corner of the polar, so a fair die is Alexandrov's problem of prescribing curvature, with equal masses. Theorem A follows from Alexandrov's theorem (1942; proofs by Oliker, 2007, and Bertrand, 2016): a set of N face directions carries a fair die exactly when it satisfies Alexandrov's condition for equal masses, and the die is then unique up to scale. Its symmetry group is exactly the symmetry group of its face directions, so a group that fixes only the centre makes the centre the centroid. For equal masses the condition becomes a finite test, and it always holds when the directions come in opposite pairs. With the rule, the list becomes exact. On the symmetry axes of a cube and an icosahedron that share their three 2-fold axes, under the seven groups of these two frames, there are exactly 149 fair dice with at least two kinds of face, the Aequi of the main catalogue: Ih 4, Oh 4, Td 3, Th 47 and T 91 (each in two hands), none with symmetry exactly O or I; by number of kinds of face, 26 with two, 41 with three, and 82 Aequi Mosaici with four to seven. We number and name all 149. Related solids: with both placements of the icosahedron against the cube there are 1083 more (among them 31 = 2⁵ − 1 with symmetry O and 53 = 2⁶ − 2³ − 3 with symmetry Oh, both counts exact by Theorem A), and below the frame groups a dataset of 4553 in all. Builds on Equanimity (#111, DICTO DOI: 10.5281/zenodo.24379796). Computation, proofs, verification and drafting with Claude (Anthropic).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24383314
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Fair Dice — The Aequi: Enumerating the Innumerable

DICTO
Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
preprint

Fair Dice — The Aequi: Enumerating the Innumerable

DICTO
preprint en

Abstract

A die is fair in the solid-angle model when every face, seen from the centre, fills the same share 4π/N of the sky. Fair dice are innumerable: every choice of face directions gives a new problem. We show that one rule covers them all. Through the polar body, the solid angle of a face is the integral Gauss curvature at the matching corner of the polar, so a fair die is Alexandrov's problem of prescribing curvature, with equal masses. Theorem A follows from Alexandrov's theorem (1942; proofs by Oliker, 2007, and Bertrand, 2016): a set of N face directions carries a fair die exactly when it satisfies Alexandrov's condition for equal masses, and the die is then unique up to scale. Its symmetry group is exactly the symmetry group of its face directions, so a group that fixes only the centre makes the centre the centroid. For equal masses the condition becomes a finite test, and it always holds when the directions come in opposite pairs. With the rule, the list becomes exact. On the symmetry axes of a cube and an icosahedron that share their three 2-fold axes, under the seven groups of these two frames, there are exactly 149 fair dice with at least two kinds of face, the Aequi of the main catalogue: Ih 4, Oh 4, Td 3, Th 47 and T 91 (each in two hands), none with symmetry exactly O or I; by number of kinds of face, 26 with two, 41 with three, and 82 Aequi Mosaici with four to seven. We number and name all 149. Related solids: with both placements of the icosahedron against the cube there are 1083 more (among them 31 = 2⁵ − 1 with symmetry O and 53 = 2⁶ − 2³ − 3 with symmetry Oh, both counts exact by Theorem A), and below the frame groups a dataset of 4553 in all. Builds on Equanimity (#111, DICTO DOI: 10.5281/zenodo.24379796). Computation, proofs, verification and drafting with Claude (Anthropic).

Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon