Geodesic
Words with intervening neighbours in infinite Coxeter groups are reduced.
The electronic journal of combinatorics, Tome 17 (2010)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
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.
DOI : 10.37236/458
Classification : 20F55, 05C25, 20F05, 20F10
Mots-clés : intervening neighbours property, Coxeter graphs, root automata, reduced words 
Henrik Eriksson; Kimmo Eriksson. Words with intervening neighbours in infinite Coxeter groups are reduced.. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/458
@article{10_37236_458,
     author = {Henrik Eriksson and Kimmo Eriksson},
     title = {Words with intervening neighbours in infinite {Coxeter} groups are reduced.},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/458},
     zbl = {1188.20035},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/458/}
}
TY  - JOUR
AU  - Henrik Eriksson
AU  - Kimmo Eriksson
TI  - Words with intervening neighbours in infinite Coxeter groups are reduced.
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/458/
DO  - 10.37236/458
ID  - 10_37236_458
ER  - 
%0 Journal Article
%A Henrik Eriksson
%A Kimmo Eriksson
%T Words with intervening neighbours in infinite Coxeter groups are reduced.
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/458/
%R 10.37236/458
%F 10_37236_458

Cité par Sources :