Expected reflection distance in G(r, 1, n) after a fixed number of reflections

• 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.

Ämnesord

NATURVETENSKAP  -- Matematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics (hsv//eng)

Nyckelord

complex reflection groups

reflection distances

random walks

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)