arXiv (All)
open access
Computer-Assisted Results for \(n\)-Sided Non-Transitive Dice Taking Face Values in \([n]\)
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. Fo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Counting Near-Spanning Matchings in Latin Squares and Steiner Triple Systems#998575
- Maximum uniformly resolvable decompositions of K-v and K-v - I into 3-stars and 3-cycles#955112
- Bounded compositions and products of chains, or bi(s)nomials everywhere from de Moivre's formula to spin multiplicities and constant-sum codes#1446910
- Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds#1117649
- A parking function analog of the Schröder numbers#1076306
Record · ID 1491929
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive