On the Efficiency of Coxeter Groups

If G is a finitely presented group and K is any (G,2)-complex(that is, a finite 2-complex with fundamental group G), thenit is well known that X(K) (G), where (G) = 1–rk H₁G+ dH₂G. We define (G) to be min{(K): K a (G, 2)-complex}, andwe say that G is efficient if (G)=(G). In this paper we givesufficient conditions for a Coxeter group to be efficient (Theorem4.2). We also give examples of inefficient Coxeter groups (Theorem5.1). In fact, we give an infinite family G_n(n = 2, 3, 4, ...)of Coxeter groups such that (G_n)–(G_n) as n . 1991 MathematicsSubject Classification 20F05, 20F55.     

On Subgroup Separability in Hyperbolic Coxeter Groups

We prove that certain hyperbolic Coxeter groups are separable on their geometrically finite subgroups.     

On Negative Orbits of Finite Coxeter Groups

For a Coxeter group W, X a subset of W and a positive root, we define the negative orbit of under X to be {w · | w X} ^–, where ^– is the set of negative roots. Here we investigate the sizes of such sets as varies in the case when W is a finite Coxeter group and X is a conjugacy class of W.     

On the Direct Indecomposability of Infinite Irreducible Coxeter Groups and the Isomorphism Problem of Coxeter Groups

In this article, we prove that any irreducible Coxeter group of infinite order, which is possibly of infinite rank, is directly indecomposable as an abstract group. 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 involu-tions. As a consequence, the problem of deciding whether two general Coxeter groups are isomorphic is reduced to the case of irreducible ones. We also describe the automorphism group of a general Coxeter group in terms of those of its irreducible components.     

On Reflection Subgroups of Finite Coxeter Groups

Let W be a finite Coxeter group. We classify the reflection subgroups of W up to conjugacy and give necessary and sufficient conditions for the map that assigns to a reflection subgroup R of W the conjugacy class of its Coxeter elements to be injective, up to conjugacy.     

On the Derived Series of Coxeter Groups

Let G be a group and let φ(G) be the least integer k such that G^(k) = G^(k+1). If no such k exists, then φ(G) = ∞ and we write G ∈ 𝒰. We are interested in the questions which Coxeter groups are in 𝒰 and how large can finite φ(G) be for Coxeter groups. The second author answered these questions for 3-generator and 4-generator Coxeter groups. This article begins the study for the 5-generator case.     

On the Derived Length of Coxeter Groups

We characterize certain properties of the derived series of Coxeter groups by properties of the corresponding Coxeter graphs. In particular, we give necessary and sufficient conditions for a Coxeter group to be quasiperfect.     

Shadows in Coxeter Groups

Annals of Combinatorics - For a given w in a Coxeter group W, the elements u smaller than w in Bruhat order can be seen as the end alcoves of stammering galleries of type w in the Coxeter complex...     

On the Maximally Clustered Elements of Coxeter Groups

We continue the study of the maximally clustered elements for simply laced Coxeter groups which were recently introduced by Losonczy. Such elements include as a special case the freely braided elements introduced by Losonczy and the author, which in turn constitute a superset of the i ji-avoiding elements of Fan. Our main result is to classify the MC-finite Coxeter groups, namely, those Coxeter groups having finitely many maximally clustered elements. Remarkably, any simply laced Coxeter group having finitely many i ji-avoiding elements also turns out to be MC-finite.     

On the Fully Commutative Elements of Coxeter Groups

Let W be a Coxeter group. We define an element w ε W to be fully commutative if any reduced expression for w can be obtained from any other by means of braid relations that only involve commuting generators. We give several combinatorial characterizations of this property, classify the Coxeter groups with finitely many fully commutative elements, and classify the parabolic quotients whose members are all fully commutative. As applications of the latter, we classify all parabolic quotients with the property that (1) the Bruhat ordering is a lattice, (2) the Bruhat ordering is a distributive lattice, (3) the weak ordering is a distributive lattice, and (4) the weak ordering and Bruhat ordering coincide. Partially supported by NSF Grants DMS-9057192 and DMS-9401575.     

On Finite Groups with a Given Number of Centralizers

For a finite group G, let Cent(G) denote the set of centralizers of single elements of G and #Cent(G) = |Cent(G)|. G is called an n-centralizer group if #Cent(G) = n, and a primitive n-centralizer group if #Cent(G) = #Cent(G/Z(G)) = n. In this paper, we compute #Cent(G) for some finite groups G and prove that, for any positive integer n 2, 3, there exists a finite group G with #Cent(G) = n, which is a question raised by Belcastro and Sherman [2]. We investigate the structure of finite groups G with #Cent(G) = 6 and prove that, if G is a primitive 6-centralizer group, then G/Z(G) A₄, the alternating group on four letters. Also, we prove that, if G/Z(G) A₄, then #Cent(G) = 6 or 8, and construct a group G with G/Z(G) A₄ and #Cent(G) = 8.This research was in part supported by a grant from IPM.2000 Mathematics Subject Classification: 20D99, 20E07     

On a Parabolic Symmetry of Finite Coxeter Groups

Let (W, S be a finite Coxeter system, and let JS. Any wW hasa unique factorization w = w^J w_J, where w_j belongs to the parabolicsubgroup W_J generated by J, and w^J is of minimal length in thecoset wW_J. It is shown here that w_I = w^J if and only if w^I =w_J, for all I, J S. Furthermore, a similar symmetry propertyin arbitrary (W_I, W_J-double cosets is conjectured, which linksthis result to the Solomon descent algebra of W. 2000 MathematicsSubject Classification 20F55.     

Coxeter Transformations in Quantum Groups

It is natural to define a Coxeter transformation in quantum groups by the product of Lusztig's symmetries in some order. In this note, we show that the Ringel–Hall algebra approach enables us to determine the behavior of its action in case of finite type.     

Rigidity of Coxeter Groups and Artin Groups

A Coxeter group is rigid if it cannot be defined by two nonisomorphic diagrams. There have been a number of recent results showing that various classes of Coxeter groups are rigid, and a particularly interesting example of a nonrigid Coxeter group has been given by Bernhard Mühlherr. We show that this example belongs to a general operation of diagram twisting. We show that the Coxeter groups defined by twisted diagrams are isomorphic, and, moreover, that the Artin groups they define are also isomorphic, thus answering a question posed by Charney. Finally, we show a number of Coxeter groups are reflection rigid once twisting is taken into account.     

Centralizers of Involutions in Locally Finite Groups

The present article deals with locally finite groups G having an involution φ such that C _G (φ) is an SF-group. It is shown that G possesses a normal subgroup B which is a central product of finitely many groups isomorphic to PSL(2, K _i ) or SL(2, K _i ) for some infinite locally finite fields K _i of odd characteristic, such that [G, φ]′/B and G/[G, φ] are both SF-groups.