Change search
ReferencesLink to record
Permanent link

Direct link
Expected reflection distance in G(r,1,n) after a fixed number of reflections
Department of Mathematics, Royal Institute of Technology, Stockholm.ORCID iD: 0000-0002-6444-7878
Fachbereich Mathematik und Informatik, Philipps-Universitat Marburg, Marburg, Germany.
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
Basel, Switzerland: Birkhäuser Verlag, 2005. Vol. 9, no 1, 21-33 p.
National Category
URN: urn:nbn:se:oru:diva-41710DOI: 10.1007/s00026-005-0238-yISI: 000241529400002ScopusID: 2-s2.0-17444377570OAI: diva2:780979
Available from: 2015-01-15 Created: 2015-01-15 Last updated: 2015-09-30Bibliographically approved

Open Access in DiVA

fulltext(291 kB)9 downloads
File information
File name FULLTEXT01.pdfFile size 291 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Eriksen, Niklas
In the same journal
Annals of Combinatorics

Search outside of DiVA

GoogleGoogle Scholar
Total: 9 downloads
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: 120 hits
ReferencesLink to record
Permanent link

Direct link