Related papers: Shuffles on Coxeter groups

Consider a randomly shuffled deck of $2n$ cards with $n$ red cards and $n$ black cards. We study the average number of moves it takes to go from a randomly shuffled deck to a deck that alternates in color by performing the following move:…

We study a family of shuffling operators on the symmetric group $S_n$, which includes the top-to-random shuffle. The general shuffling scheme consists of removing one card at a time from the deck (according to some probability distribution)…

When shuffling a deck of cards, one probably wants to make sure it is thoroughly shuffled. A way to do this is by sifting through the cards to ensure that no adjacent cards are the same number, because surely this is a poorly shuffled deck.…

We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is shelf-shuffled exactly one time. One after the other a single card is drawn from the shuffled deck. The guesser makes has guess…

We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of…

We study the "top-to-random-and-reverse shuffle", defined as the top-to-random shuffle in the symmetric group algebra composed with the permutation $w_0$ (which sends each $i$ to $n+1-i$). More generally, we analyze the composition of any…

We study a family of maps from $S_n \to S_n$ we call fixed point homing shuffles. These maps generalize a few known problems such as Conway's Topswops, and a card shuffling process studied by Gweneth McKinley. We show that the iterates of…

We study how many riffle shuffles are required to mix n cards if only certain features of the deck are of interest, e.g. suits disregarded or only the colors of interest. For these features, the number of shuffles drops from 3/2 log_2(n) to…

Standard perfect shuffles involve splitting a deck of $2n$ cards into two stacks and interlacing the cards from the stacks. There are two ways that this interlacing can be done, commonly referred to as an in shuffle and an out shuffle,…

We introduce a new type of card shuffle called one-sided transpositions. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it. This defines a random walk on the symmetric…

We introduce and analyze the $S_k$ shuffle on $N$ cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the $S_k$ shuffle, we choose uniformly at random a block of $k$ consecutive cards, and shuffle…

Analogues of 1-shuffle elements for complex reflection groups of type $G(m,1,n)$ are introduced. A geometric interpretation for $G(m,1,n)$ in terms of rotational permutations of polygonal cards is given. We compute the eigenvalues, and…

Consider an n by n array of cards shuffled in the following manner. An element x of the array is chosen uniformly at random; Then with probability 1/2 the rectangle of cards above and to the left of x is rotated 180 degrees, and with…

This paper studies the game of guessing riffle-shuffled cards with complete feedback. A deck of $n$ cards labelled 1 to $n$ is riffle-shuffled once and placed on a table. A player tries to guess the cards from top and is given complete…

These are detailed lecture notes of the crash-course on shuffle algebras delivered by the author at Tokyo University of Marine Science and Technology during the second week of March 2019. These notes consist of three chapters, providing a…

The number of ``carries'' when $n$ random integers are added forms a Markov chain [23]. We show that this Markov chain has the same transition matrix as the descent process when a deck of $n$ cards is repeatedly riffle shuffled. This gives…

Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…

We define slope subalgebras in the shuffle algebra associated to a (doubled) quiver, thus yielding a factorization of the universal R-matrix of the double of the shuffle algebra in question. We conjecture that this factorization matches the…

Divide a deck of $kn$ cards into $k$ equal piles and place them from left to right. The standard shuffle $\sigma$ is performed by picking up the top cards one by one from left to right and repeating until all cards have been picked up. For…

Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group S_n are different, they both satisfy a convolution property. Strong evidence is given that when the…