Shuffle Analogues for Complex Reflection Groups G(M,1,N)
P3TMA 2016–2017 Theoretical and Mathematical Physics Particle Physics and Astrophysics Shuffle analogues for complex reflection groups G(m, 1, n) Varvara Petrova Faculté des Sciences Internship carried out at Centre de Physique Théorique 2017 March 6 - June 23 under the supervision of Oleg Ogievetsky Abstract 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 their multiplicities, of the 1-shuffle element in the algebra of the group G(m, 1, n). We report on the spectrum of the 1-shuffle analogue in the cyclotomic Hecke algebra H(m, 1, n) for m = 2 and small n. Considering shuffling as a random walk on the group G(m, 1, n), we estimate the rate of convergence to randomness of the corresponding Markov chain. The project leading to this internship report has received funding from Excellence Initiative of Aix-Marseille University - A*MIDEX, a French “Investissements d’Avenir” programme. Contents Introduction1 1 Complex reflection groups of type G(m,1,n)2 1.1 Generalities about reflection groups...............2 1.2 Groups G(m,1,n).........................2 1.3 Rotational permutations of m-cards..............4 1.4 Todd-Coxeter algorithm for the chain of groups G(m,1,n)..8 2 Shuffle analogues in G(m,1,n) group algebra 13 2.1 Symmetrizers and shuffles.................... 13 2.2 Shuffle analogues in G(m,1,n) group algebra.......... 15 2.3 Minimal polynomial and multiplicities of eigenvalues....
[Show full text]