Mathematics – Combinatorics
Scientific paper
2008-11-26
Mathematics
Combinatorics
Scientific paper
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 irreducible if the group is infinite and irreducible. We present a new and shorter proof using the root automaton for recognition of irreducible words.
Eriksson Henrik
Eriksson Kimmo
No associations
LandOfFree
Words with intervening neighbours in infinite Coxeter groups are reduced does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Words with intervening neighbours in infinite Coxeter groups are reduced, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Words with intervening neighbours in infinite Coxeter groups are reduced will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-275006