Irreducible Coxeter Groups
نویسنده
چکیده
We prove that an infinite irreducible Coxeter group cannot be a non-trivial direct product. Let W be a Coxeter group, and write W = W1 × · · · ×Wp ×Wp+1, where W1, . . . ,Wp are infinite irreducible Coxeter groups, and Wp+1 is a finite one. As an application of the main result, we obtain that W1, . . . ,Wp are unique and Wp+1 is unique up to isomorphism. That is, if W = W̃1 × · · · × W̃q × W̃q+1 is another decomposition where W̃1, . . . , W̃q are infinite irreducible Coxeter groups and W̃q+1 is a finite one, then p = q, W̃p+1 ≃ Wp+1, and there is a permutation χ ∈ Symp such that W̃χ(i) = Wi for all 1 ≤ i ≤ p. AMS Subject Classification: Primary 20F55.
منابع مشابه
On the Direct Indecomposability of Infinite Irreducible Coxeter Groups and the Isomorphism Problem of Coxeter Groups
In this paper we prove that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group, without the finite rank assumption. The key ingredient of the proof is that we can determine, for an irreducible Coxeter group W , the centralizers in W of the normal subgroups of W that are generated by involutions. As a consequence, we show that the problem of deciding ...
متن کاملOn the Isomorphism Problem for Finitely Generated Coxeter Groups. I Basic Matching
The isomorphism problem for finitely generated Coxeter groups is the problem of deciding if two finite Coxeter matrices define isomorphic Coxeter groups. Coxeter [3] solved this problem for finite irreducible Coxeter groups. Recently there has been considerable interest and activity on the isomorphism problem for arbitrary finitely generated Coxeter groups. In this paper, we determine some stro...
متن کاملMatching Theorems for Systems of a Finitely Generated Coxeter Group
The isomorphism problem for finitely generated Coxeter groups is the problem of deciding if two finite Coxeter matrices define isomorphic Coxeter groups. Coxeter [3] solved this problem for finite irreducible Coxeter groups. Recently there has been considerable interest and activity on the isomorphism problem for arbitrary finitely generated Coxeter groups. For a recent survey, see Mühlherr [10...
متن کاملOn Irreducible, Infinite, Non-affine Coxeter Groups
The following results are proved: (1) The center of any finite index subgroup of an irreducible, infinite, non-affine Coxeter group is trivial; (2) Any finite index subgroup of an irreducible, infinite, non-affine Coxeter group cannot be expressed as a product of two nontrivial subgroups. These two theorems imply a unique decomposition theorem for a class of Coxeter groups. . MSC 2000 Subject C...
متن کاملDeterminants of Representations of Coxeter Groups
In [APS17], the authors characterize the partitions of n whose corresponding representations of Sn have nontrivial determinant. The present paper extends this work to all irreducible finite Coxeter groups W . Namely, given a nontrivial multiplicative character ω of W , we give a closed formula for the number of irreducible representations of W with determinant ω. For Coxeter groups of type Bn a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 17 شماره
صفحات -
تاریخ انتشار 2007