Expected Reflection Distance in G(r, 1, n) after a Fixed Number of Reflections
- 25 Downloads
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.
AMS Subject Classification.05C12 82B41 51F15
Keywords.complex reflection groups reflection distances random walks
Unable to display preview. Download preview PDF.