Related papers: Shuffles on Coxeter groups
In a recent work Conger and Howald derived asymptotic formulas for the randomness, after shuffling, of decks with repeating cards or all-distinct decks dealt into hands. In the latter case the deck does not need to be fully randomized: the…
In the Gilbert-Shannon-Reeds shuffle, a deck of $N$ cards is cut into two approximately equal parts which are then riffled uniformly at random. Bayer and Diaconis famously showed that this Markov chain undergoes cutoff in total variation…
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 consider the algebra of Hecke correspondences (elementary transformations at a single point) acting on the algebraic K-theory groups of the moduli spaces of stable sheaves on a smooth projective surface S. We derive quadratic relations…
We consider a card guessing game with complete feedback. A ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to maximize the number of correct guesses of the cards, where one after…
How many shuffles are needed to mix up a deck of cards? This question may be answered in the language of a random walk on the symmetric group, $S_{52}$. This generalises neatly to the study of random walks on finite groups, themselves a…
In this paper, we introduce certain new features of the shuffle algebra, that will allow us to obtain explicit formulas for the isomorphism between its Drinfeld double and the elliptic Hall algebra.
Consider n cards that are labeled 1 through n with n an even integer. The cards are put face down and their ordering starts with card labeled 1 on top through card labeled n at the bottom. The cards are top to random shuffled m times and…
Inspired by a common technique for shuffling a deck of cards on a table without riffling, we formalize the pile shuffle and investigate its capabilities as a sorting device. Our study is novel in that we consider pile shuffle in three…
In this article, we introduce the notion of cluster automorphism of a given cluster algebra as a $\ZZ$-automorphism of the cluster algebra that sends a cluster to another and commutes with mutations. We study the group of cluster…
We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle,…
The well-known Gilbert-Shannon-Reeds model for riffle shuffles assumes that the cards are initially cut 'about in half' and then riffled together. We analyze a natural variant where the initial cut is biased. Extending results of Fulman…
Shuffle algebras are monoids for an unconvential monoidal category structure on graded vector spaces. We present two homological results on shuffle algebras with monomial relations, and use them to prove exact and asymptotic results on…
Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…
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…
Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results…
In this paper, we study some cards shuffles which are used by magicians. We focus ourselves on the possibility to hit eventually the initial state after several shuffles. This is a classical problem arising in discrete dynamical systems.…
In the top to random shuffle, the first a cards are removed from a deck of n cards 12 \cdots n and then inserted back into the deck. This action can be studied by treating the top to random shuffle as an element B_a, which we define…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
The thesis consider the mixing of few (3-4) card shuffling as well as of large (52 card) deck. The thesis is showing the limit on the shuffling to homogeneity elaborated in short program; the thesis is in italian.