Words with intervening neighbours in infinite Coxeter groups are reduced

Simple item page
dc.creatorEriksson, Henrik
dc.creatorEriksson, Kimmo
dc.date2008-11-26
dc.date.accessioned2026-07-07T12:04:52Z
dc.date.available2026-07-07T12:04:52Z
dc.descriptionConsider 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.
dc.identifierhttps://arxiv.org/abs/0811.4380
dc.identifierhttp://arxiv.org/abs/0811.4380
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/208228
dc.subjectCombinatorics
dc.subject05E15
dc.titleWords with intervening neighbours in infinite Coxeter groups are reduced
dc.typetext

Files

Collections

arXiv