Timeline for Nontransitive dice: the least number of faces?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Aug 24, 2013 at 0:54 | comment | added | Eden Harder | @WillSawin It is a cool idea! We can always to do this perturbation, but the nontransitivity is only related to the order of the numbers but not what they exactly are. | |
| Aug 24, 2013 at 0:38 | comment | added | Will Sawin |
What about the second question? There are many large nontransitive arrangements that are not nontransitive in an interesting way. For instance, take lots of small perturbations of your dice: $\{1.01,5.02,8.99\}$ and so on. This will give a large number of nontransitive dice for $m=3$. But this doesn't seem like the right case to consider.
|
|
| Aug 23, 2013 at 23:45 | comment | added | Eden Harder | @WillSawin Yeah $n$ is the number of dice. | |
| Aug 23, 2013 at 17:55 | comment | added | Will Sawin | What is $n$? The number of dice? How nontransitive must they be? | |
| Aug 23, 2013 at 14:22 | comment | added | Eden Harder | $m=3$ for $n=3$, for example, the three dices are {1,5,9}, {2,6,7},{3,4,8}. | |
| Aug 23, 2013 at 11:05 | history | asked | Eden Harder | CC BY-SA 3.0 |