Timeline for Order of the "children's card shuffle"
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 16 at 14:41 | comment | added | JimmyJames | I'm surely missing the point here but isn't that process deterministic? Is that really just 'reordering' instead of 'shuffling'? A 'perfect' shuffle isn't really a shuffle at all. For example, if you execute perfect riffle shuffles repeatedly, the deck eventually returns to its original order. | |
| May 15 at 15:13 | history | became hot network question | |||
| May 15 at 13:06 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 1 character in body
|
| May 15 at 13:04 | vote | accept | Dominic van der Zypen | ||
| May 15 at 13:04 | comment | added | Dominic van der Zypen | Thanks @ChrisWuthrich -- my son just found an inconsistency in ${\sf (ZF)}$ and will publish it before going back to afternoon school | |
| May 15 at 10:33 | answer | added | Will Sawin | timeline score: 14 | |
| May 15 at 9:31 | comment | added | Chris Wuthrich | Congratulations to your son's rediscovery of a shuffle that Monge wrote a paper about in 1773 according to p 107 in W.W. Rouse Ball's book | |
| May 15 at 9:20 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 10 characters in body
|
| May 15 at 8:23 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
deleted 146 characters in body
|
| May 15 at 8:21 | comment | added | Dominic van der Zypen | Thanks @PeterTaylor, will remove question 2 | |
| May 15 at 7:40 | comment | added | Peter Taylor | That answers question 2, because we have $2^{\operatorname{ord}(\text{sh}_n)} + 1 \ge 4n + 1$, so $\operatorname{ord}(\text{sh}_n) \ge 2 + \lg n$. | |
| May 15 at 7:32 | comment | added | Peter Taylor | oeis.org/A019567 | |
| May 15 at 7:13 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |