Year: 2026
Type: preprint
Abstract: Suppose that each of $n$ players rolls a different die and the players are ordered by their rolls. Can the dice use disjoint labels such that ties are impossible, while all $n!$ orders remain equally likely? We give two general constructions of such dice and solve some related problems.
Source: arXiv (Cornell University)
Institutions: Charles University, ETH Zurich
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Award: G7868528249
OpenAlex ID: W7221799093