Cyclotomic shuffles
O. Ogievetsky, V. Petrova

TL;DR
This paper introduces and analyzes analogues of 1-shuffle elements for complex reflection groups of type G(m,1,n), providing geometric interpretations, eigenvalue computations, and convergence estimates for associated random walks.
Contribution
It presents new 1-shuffle analogues for G(m,1,n), computes their eigenvalues, and studies their spectral properties and convergence in related algebraic structures.
Findings
Eigenvalues and multiplicities of 1-shuffle elements computed
Geometric interpretation in terms of polygonal rotations provided
Convergence rates of the associated Markov chains estimated
Abstract
Analogues of 1-shuffle elements for complex reflection groups of type are introduced. A geometric interpretation for in terms of rotational permutations of polygonal cards is given. We compute the eigenvalues, and their multiplicities, of the 1-shuffle element in the algebra of the group . Considering shuffling as a random walk on the group , we estimate the rate of convergence to randomness of the corresponding Markov chain. We report on the spectrum of the 1-shuffle analogue in the cyclotomic Hecke algebra for and small .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Random Matrices and Applications · Markov Chains and Monte Carlo Methods
