Words with intervening neighbours in infinite Coxeter groups are reduced
2010 (English)In: The Electronic Journal of Combinatorics, ISSN 1077-8926, Vol. 17, no 1, N9- p.Article in journal (Refereed) Published
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.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-25019ISI: 000274067600003ScopusID: 2-s2.0-77955652058OAI: oai:DiVA.org:kth-25019DiVA: diva2:355012
QC 201010052010-10-052010-10-052011-01-24Bibliographically approved