2000 character limit reached
Possible probability and irreducibility of balanced non-transitive dice
Published 23 Jun 2020 in math.PR and math.CO | (2006.12866v2)
Abstract: We construct irreducible balanced non-transitive sets of $n$-sided dice for any positive integer $n$, which was raised in \cite[Question 5.2]{SS17}. One main tool of the construction is to study so-called fair sets of dice. Furthermore, we also study the distribution of the probabilities of balanced non-transitive sets of dice. For a lower bound, we show that the probability could be arbitrarily close to $\frac{1}{2}$ and for a upper bound, we construct a balanced non-transitive set of dice whose probability is $\frac{1}{2} + \frac{13-\sqrt{153}}{24} \approx \frac{1}{2} + \frac{1}{9.12}.$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.