Change search
ReferencesLink to record
Permanent link

Direct link
Conjugacy of Coxeter elements
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.
2009 (English)In: The Electronic Journal of Combinatorics, ISSN 1077-8926, Vol. 16, no 2Article in journal (Refereed) Published
Abstract [en]

For a Coxeter group (W, S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter elements are rotation equivalent if their words can be transformed into each other through a sequence of rotations and legal commutations. We prove that Coxeter elements are conjugate if and only if they are rotation equivalent. This was known for some special cases but not for Coxeter groups in general.

Place, publisher, year, edition, pages
2009. Vol. 16, no 2
National Category
URN: urn:nbn:se:kth:diva-24368ISI: 000263969200001OAI: diva2:349148
QC 20100906Available from: 2010-09-06 Created: 2010-09-06 Last updated: 2010-09-21Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Eriksson, Henrik
By organisation
Numerical Analysis and Computer Science, NADA
In the same journal
The Electronic Journal 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

Total: 25 hits
ReferencesLink to record
Permanent link

Direct link