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.
> 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.