ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a fair balanced non-transitive set of dice, represented by a word over three letters xx, yy, and zz. The length of DD is the length of this word, and two words are similar when one can be obtained from the other by the exchanges specified earlier in the paper.

Fair-dice decomposition conjecture. If DD is fair, then the length of DD is a multiple of 66 and DD is similar to a product of copies of xyzzyxxyzzyx.

This conjecture describes the proposed normal form for fair sets of dice under the paper's similarity operations. The supplied text does not state whether it has been proved or disproved.

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.