Sur le group des automorphismes de certains groupes de Coxeter. (On the automorphism group of certain Coxeter groups) (Q1110658): Difference between revisions

Let \(\Gamma\) be a finite graph, \(S=vert \Gamma\) the set of vertices of \(\Gamma\) and \(A=edge \Gamma\) the set of edges of \(\Gamma\). Let \(W=W(\Gamma)\) be the group defined by the following presentation: \(W=<S\); \(s^ 2=1\) for \(s\in S\), \(ss'=s's\) for \((s,s')\in S\times S-A>\). Namely, (W,S) is a Coxeter system corresponding to a Coxeter matrix whose off diagonal coefficients are 2 or \(\infty\) and the graph \(\Gamma\) describes the distribution of the coefficients \(\infty\) of the matrix. Let \(F=F(\Gamma)=\{S_ 1\subset S\); \((S_ 1\times S_ 1)\cap A=\emptyset \}\), then F is a finite groupoid with respect to the symmetric difference. The group Aut(F) of automorphisms of F can be identified with a subgroup of Aut(W). In this paper, the author proves that if the graph \(\Gamma\) has no triangle, Aut(W) is a semi-direct product of Aut(F) and Int(W). If the graph \(\Gamma\) is not so complicated, it is easy to determine Aut(F) and also Aut(W). The author gives some examples of the determination of the group Aut(F).