The fair-dice decomposition conjecture
Statement
Let be a fair balanced non-transitive set of dice, represented by a word over three letters , , and . The length of 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 is fair, then the length of is a multiple of and is similar to a product of copies of .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.