Dept. Math, Hokkaido Univ. EPrints Server

The isomorphism problem of Coxeter groups and related topics

NUIDA, Koji The isomorphism problem of Coxeter groups and related topics. In: 表現論シンポジウム.

[img]PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

15 November 2005: 表現論シンポジウム


The isomorphism problem of Coxeter groups and related topics Koji NUIDA12 Graduate School of Mathematical Sciences University of Tokyo doctor’s course, 3rd year A group W is called a Coxeter group if there is a generating set S of W (Coxeter generating set), consisting of elements of order 2, such that W admits the following group presentation W = ⟨S | (st)o(st) = 1 for all s, t ∈ S with o(st) < ∞⟩ where o(st) denotes the order of st ∈ W. (In this talk S is not assumed to be a finite set.) As you know well, Coxeter groups arise from representation theory quite often, e.g. as Weyl groups, where the Coxeter generating set is usually given naturally by the context and so the ‘type’ of the Coxeter group is uniquely determined. However, it is not true that the type of a Coxeter group is always uniquely determined by the group itself; namely, when regarding as abstract groups, two Coxeter groups of different types may be isomorphic with each other. In other words, a choice of a Coxeter generating set of a Coxeter group has certain variations in general. A typical example is the Weyl group G2 (or the Coxeter group of type I2(6)) which is isomorphic to the direct product S2 × S3 of two symmetric groups (so it also admits a Coxeter generating set of type A1×A2). This example also shows that, even if a Coxeter group is irreducible with respect to a given Coxeter generating set, it may be reducible with respect to another Coxeter generating set. The isomorphism problem of Coxeter groups is, roughly speaking, the problem of deciding when such phenomena occur. Although the theory of Coxeter groups has a long history, almost all of the results on the isomorphism problem (except those on the finite Coxeter groups) were obtained very recently, namely in this decade. The aim of this talk is to introduce those recent results on this problem and related topics, e.g. the following results of the speaker: Theorem. Let W be a Coxeter group with Coxeter generating set S. 1. If W is irreducible (with respect to S) and |W| = ∞, then W is irreducible with respect to every Coxeter generating set. More strongly, W is directly indecomposable as an abstract group. 2. The product of all finite irreducible component of W (with respect to S) is independent on the choice of S. 3. Suppose that |W| = ∞ and either “o(st) < ∞ for all s, t ∈ S” or “all elements of S are conjugate in W”. Then the set of reflections in W is independent on the choice of S.

Item Type:Conference or Workshop Item (Proceedings)
ID Code:1911