论文信息 - Expected Reflection Distance in G(r, 1, n) after a Fixed Number of Reflections

Expected Reflection Distance in G(r, 1, n) after a Fixed Number of Reflections

Abstract.Extending to r > 1 a formula of the authors, we compute the expected reflection distance of a product of t random reflections in the complex reflection group G(r, 1, n). The result relies on an explicit decomposition of the reflection distance function into irreducible G(r, 1, n)-characters and on the eigenvalues of certain adjacency matrices.

Axel Hultman | Niklas Eriksen | Axel Hultman | N. Eriksen

[1] James Allen Fill,et al. Mixing Times for Markov Chains on Wreath Products and Related Homogeneous Spaces , 2000 .

[2] Clyde H. SchoolfieldJr.. Random Walks on Wreath Products of Groups , 2002 .

[3] H. Coxeter,et al. Regular Complex Polytopes , 1991 .

[4] Random Walks on Wreath Products of Groups , 2000, math/0006118.

[5] Axel Hultman,et al. Estimating the expected reversal distance after a fixed number of reversals , 2004, Adv. Appl. Math..

[6] I. G. MacDonald,et al. Symmetric functions and Hall polynomials , 1979 .

[7] P. Diaconis. Group representations in probability and statistics , 1988 .

[8] M. Dyer,et al. On the "Bruhat graph" of a Coxeter system , 1991 .

[9] Noboru Ito. The spectrum of a conjugacy class graph of a finite group , 1984 .

[10] S. Ariki,et al. A Hecke Algebra of (Z/rZ)Sn and Construction of Its Irreducible Representations , 1994 .