OpenAlex ·
Computer-Assisted Results for \(n\)-Sided Non-Transitive Dice Taking Face Values in \([n]\)
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.40321
- Original
- Read it at the publisher
- Topics
Abstract
We consider non-transitivity among dice with \(n\) sides restricted to taking face values in the set \(\{1,\ldots,n\}\). We give a computer-assisted proof that \(n=6\) is the smallest \(n\ge3\) which admits a non-transitive cycle of maximum length \(n\) with uniform and minimal winning advantage. For \(n=6\), we identify the two unique non-transitive cycles of length \(6\). We present computational evidence supporting a conjecture that \(n=6\) is the largest \(n\ge3\) which admits a non-transitive cycle of maximum length \(n\) with uniform and minimal winning advantage.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
Four-Coloring Planar Graphs in Linear Time
Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes
From Trees to Binary Trees: Approximation Algorithms and a PTAS
Traveling Salesman Problem on Graphs with Proportional Independent Set
Half-Optimal Induced Matchings in Random Graphs: Online and Low-Degree Algorithms
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.