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.
Cite
CITATION STYLE
APA
Bahls, P. (2005). Automorphisms of Coxeter groups. Transactions of the American Mathematical Society, 358(4), 1781–1796. https://doi.org/10.1090/s0002-9947-05-03779-7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free