Change search
ReferencesLink to record
Permanent link

Direct link
Expected reflection distance in G(r, 1, n) after a fixed number of reflections
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2005 (English)In: Annals of Combinatorics, ISSN 0218-0006, E-ISSN 0219-3094, Vol. 9, no 1, 21-33 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2005. Vol. 9, no 1, 21-33 p.
Keyword [en]
complex reflection groups, reflection distances, random walks
URN: urn:nbn:se:kth:diva-15337DOI: 10.1007/s00026-005-0238-yISI: 000241529400002ScopusID: 2-s2.0-17444377570OAI: diva2:333378
QC 20100525Available from: 2010-08-05 Created: 2010-08-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Hultman, Axel
By organisation
Mathematics (Div.)
In the same journal
Annals of Combinatorics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link