Change search
ReferencesLink to record
Permanent link

Direct link
Words with intervening neighbours in infinite Coxeter groups are reduced
KTH, School of Computer Science and Communication (CSC).
2010 (English)In: The Electronic Journal of Combinatorics, ISSN 1077-8926, Vol. 17, no 1, N9- p.Article in journal (Refereed) Published
Abstract [en]

Consider a graph with vertex set S. A word in the alphabet S has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph neighbours. For a Coxeter graph, words represent group elements. Speyer recently proved that words with the intervening neighbours property are reduced if the group is infinite and irreducible. We present a new and shorter proof using the root automaton for recognition of reduced words.

Place, publisher, year, edition, pages
2010. Vol. 17, no 1, N9- p.
Keyword [en]
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-25019ISI: 000274067600003ScopusID: 2-s2.0-77955652058OAI: diva2:355012
QC 20101005Available from: 2010-10-05 Created: 2010-10-05 Last updated: 2011-01-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Search in DiVA

By author/editor
Eriksson, HenrikEriksson, Kimmo
By organisation
School of Computer Science and Communication (CSC)
In the same journal
The Electronic Journal of Combinatorics
Computer and Information Science

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: 18 hits
ReferencesLink to record
Permanent link

Direct link