ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a random nn-sided die in the multiset model be a uniformly chosen multiset of nn positive integers between 11 and nn whose sum is n(n+1)/2n(n+1)/2. Let TT be a tournament with vertices 1,2,…,k1,2,\dots,k, and let A1,…,AkA_1,\dots,A_k be independent random nn-sided dice. The quasirandomness conjecture. The probability that, for every 1≤i<j≤k1\leq i<j\leq k, AiA_i beats AjA_j if and only if (i,j)∈T(i,j)\in T is

2−(k2)+o(1)2^{-\binom{k}{2}}+o(1)

as nn tends to infinity.

This is presented as a strengthening of the transitivity conjecture and expresses that every fixed tournament occurs with the frequency expected in a random tournament. It is attributed in the source to Conrey, Gabbard, Grant, Liu and Morrison; no resolution is given.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.