pith. sign in

arxiv: math/0310127 · v1 · submitted 2003-10-09 · 🧮 math.GR

Automorphisms of Coxeter groups

classification 🧮 math.GR
keywords coxeterconnectedgivengroupgroupsadmitsautomorphismscannot
0
0 comments X
read the original abstract

We compute Aut(W) for any even Coxeter group whose Coxeter diagram is connected, contains no edges labeled 2, and cannot be separated into more than 2 connected components by removing a single vertex. The description is given explicitly in terms of the given presentation for the Coxeter group and admits an easy characterization of those groups W for which Out(W) is finite.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.