On the isomorphism problem, indecomposability and the automorphism groups of Coxeter groups

Research output: Contribution to conferencePaperpeer-review

Abstract

Let (W, S) and (W′, S′) be Coxeter systems, {W λ} λ∈Λ and {W Λ ′′ } λ′∈Λ ′ the sets of the irreducible components of W relative to S and of W′ relative to S′ respectively, and let f : W → W′ be an isomorphism of abstract groups. Their Coxeter graphs may not be isomorphic. We show that f(Π λ∈Λ,|Wλ|<∞ W λ) = Π λ∈Λ,|Wλ′ ′|<∞W λ′′, and that there is a unique bijection φ: {λ ∈ Λ | |W λ| = ∞} → {λ ′ ∈ Λ ′ | |W λ′′| = ∞} such that f(W λ) ≡ W φ(λ)′ mod Z(W′) for every λ ∈ Λ with |W λ| = ∞, where Z(W′) is the center of W0. We also determine which two finite Coxeter groups are isomorphic. Our result reduces the problem of deciding whether two Coxeter groups are isomorphic to the case of infinite irreducible Coxeter groups. As a corollary we determine which irreducible Coxeter group is directly indecomposable as an abstract group. In particular, any infinite irreducible Coxeter group is directly indecomposable.

Original languageEnglish
Pages857-868
Number of pages12
Publication statusPublished - 2005
Externally publishedYes
Event17th Annual International Conference on Algebraic Combinatorics and Formal Power Series, FPSAC'05 - Taormina, Italy
Duration: Jun 20 2005Jun 25 2005

Conference

Conference17th Annual International Conference on Algebraic Combinatorics and Formal Power Series, FPSAC'05
Country/TerritoryItaly
CityTaormina
Period6/20/056/25/05

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory

Fingerprint

Dive into the research topics of 'On the isomorphism problem, indecomposability and the automorphism groups of Coxeter groups'. Together they form a unique fingerprint.

Cite this