A Direct Construction of Non-Transitive Dice Sets

Por • 28 oct, 2016 • Sección: Crítica

Levi Angel, Matt Davis

Abstract: In this paper, we give a direct construction for a set of dice realizing any given tournament T  . The construction for a tournament with n  vertices requires a number of sides on the order of n  , which appears to be the best general construction to date. Our construction relies only on a standard theorem from graph theory.

arXiv:1610.08595v1 [math.CO]

Combinatorics (math.CO); Probability (math.PR)

Post to Twitter

Escribe un comentario