[HN Gopher] The mathematics of shuffling
       ___________________________________________________________________
        
       The mathematics of shuffling
        
       Author : onepossibility
       Score  : 32 points
       Date   : 2021-02-03 20:40 UTC (2 hours ago)
        
 (HTM) web link (plus.maths.org)
 (TXT) w3m dump (plus.maths.org)
        
       | shakezula wrote:
       | This has a really interesting point about what's colloquially
       | called "stack shuffling" (at least in the MTG community)
       | 
       | > k piles of length n, we observed that there's a similar special
       | case when the size of the piles is a power of the number of
       | piles.
       | 
       | The "power case" here is an exponentially smaller shuffle group,
       | resulting in an exponentially smaller set of possible shuffles.
       | Really interesting and counterintuitive to me, when I think about
       | decks of cards.
        
       | trcollinson wrote:
       | One of my absolute favorite mathematicians is Persi Diaconis who
       | is mentioned in this paper and was the original basis for this
       | area of research. Well worth learning about. He was a runaway.
       | Then a magician, trained by Dai Vernon and worked along side
       | people like the late Ricky Jay and Richard Turner. He went on to
       | get PhD from Harvard and got a MacArthur Fellowship. He is a
       | legend.
       | 
       | Ricky Jay talking about his childhood friend Persi:
       | https://believermag.com/an-interview-with-ricky-jay/
       | 
       | Persi on Numberphile: https://www.youtube.com/watch?v=AxJubaijQbI
       | 
       | A great lecture: https://www.youtube.com/watch?v=xit5LDwJVck
        
       | teryyy wrote:
       | Reminds me of https://bost.ocks.org/mike/shuffle/
        
       ___________________________________________________________________
       (page generated 2021-02-03 23:01 UTC)