The one-sided cycle shuffles in the symmetric group algebra

DOI10.5802/ALCO.346MaRDI QIDQ6495792

Nadia Lafrenière, Darij Grinberg

Publication date: 2 May 2024

Published in: Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

permutationsfiltrationgroup algebrasymmetric groupMarkov chainrepresentation theoryFibonacci numberscard shufflingtop-to-random shufflesubstitutional analysis

Mathematics Subject Classification ID

Representations of finite symmetric groups (20C30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trailing the dovetail shuffle to its lair
• Spectral analysis of random-to-random Markov chains
• An exact formula for the move-to-front rule for self-organizing lists
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• The eigenvalues of hyperoctahedral descent operators and applications to card-shuffling
• Cutoff for a one-sided transposition shuffle
• Hopf algebras and Markov chains: two examples and a theory
• New results on the peak algebra.
• Spectra of Symmetrized Shuffling Operators
• The heaps process, libraries, and size-biased permutations
• On the matrix occurring in a linear search problem
• Shuffling Cards and Stopping Times
• Generating a random permutation with random transpositions
• Analysis of Top To Random Shuffles
• The Elser nuclei sum revisited
• The Fibonacci Sequence and Schreier-Zeckendorf Sets
• The stationary distribution of an interesting Markov chain

This page was built for publication: The one-sided cycle shuffles in the symmetric group algebra