Automorphisms of Coxeter groups
Patrick Bahls
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.
Create a lesson
Related papers
The variety generated by all additively idempotent semirings of order four
Mengya Yue, Xiaolei Shao
Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
Jiaping Lu
Kernel--wreath constructions and infinite families of finite simple skew braces
Marco Damele
Explicit equational bases for the power semirings of S7
Mengya Yue, Miaomiao Ren, Zidong Gao
The free multiplicative Lie algebra L(P) for a finitely generated parafree group P
Dessislava H. Kochloukova
An order automorphism of a Dlab group not induced by conjugation
Ting Gong, Yong Yang, Michael Ruofan Zeng