Related papers: The one-sided cycle shuffles in the symmetric grou…
English title: Eigenvalues of Symmetrized Shuffling Operators The random-to-random shuffling operator explains, for example, the evolution of a deck of cards subject to the following random process: draw a card randomly from the deck and…
The *somewhere-to-below shuffles* are the elements \[ t_{\ell} := \operatorname{cyc}_{\ell}+\operatorname{cyc}_{\ell,\ell+1}+\operatorname{cyc}_{\ell,\ell+1,\ell+2}+\cdots+\operatorname{cyc}_{\ell,\ell+1,\ldots,n} \] (for $\ell \in…
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 study some probabilistic and…
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…
We investigate the mathematics behind unshuffles, a type of card shuffle closely related to classical perfect shuffles. To perform an unshuffle, deal all the cards alternately into two piles and then stack the one pile on top of the other.…
A deck of $n$ cards are shuffled by repeatedly taking off the top card, flipping it with probability $1/2$, and inserting it back into the deck at a random position. This process can be considered as a Markov chain on the group $B_n$ of…
(Abridged abstract) For a finite real reflection group W and a W-orbit O of flats in its reflection arrangement---or equivalently a conjugacy class of its parabolic subgroups---we introduce a statistic on elements of W. We then study the…
The card-cyclic-to-random shuffle is the card shuffle where the $n$ cards are labeled $1,\ldots,n$ according to their starting positions. Then the cards are mixed by first picking card $1$ from the deck and reinserting it at a uniformly…
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…
In this thesis we introduce a new type of card shuffle called the one-sided transposition shuffle. 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…
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 generalize Reiner--Saliola--Welker's well-known but mysterious family of *$k$-random-to-random shuffles* from Markov chains on symmetric groups to Markov chains on the Type-$A$ Iwahori--Hecke algebras. We prove that the family of…
A deck of $n$ cards is shuffled by repeatedly moving the top card to one of the bottom $k_n$ positions uniformly at random. We give upper and lower bounds on the total variation mixing time for this shuffle as $k_n$ ranges from a constant…
We apply operad theory to enumerative combinatorics in order to count the number of shuffles between series-parallel posets and chains. We work with three types of shuffles, two of them noncommutative, for example a left deck-divider…
Given a positive integer $n$, we consider the group algebra of the symmetric group $S_{n}$. In this algebra, we define $n$ elements $t_{1},t_{2},\ldots,t_{n}$ by the formula \[…
We generalize random-to-random shuffling from a Markov chain on the symmetric group to one on the Type A Iwahori Hecke algebra, and show that its eigenvalues are polynomials in q with non-negative integer coefficients. Setting q=1 recovers…
The commutative trigonometric shuffle algebra ${\mathrm A}$ is a space of symmetric rational functions satisfying certain wheel conditions. We describe a ring isomorphism between ${\mathrm A}$ and the center of the Hecke algebra using a…
A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…
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:…
The mathematics of shuffling a deck of $2n$ cards with two "perfect shuffles" was brought into clarity by Diaconis, Graham and Kantor. Here we consider a generalisation of this problem, with a so-called "many handed dealer" shuffling $kn$…