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.     

On Normal Subgroups of Coxeter Groups Generated by Standard Parabolic Subgroups

We discuss one construction of nonstandard subgroups in the category of Coxeter groups. Two formulae for the growth series of such a subgroups are given. As an application we construct a flag simple convex polytope, whose f-polynomial has non-real roots. Partially supported by a KBN grant 2 P03A 017 25     

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 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.     

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.     

Sylvester Waves in the Coxeter Groups

A new recursive procedure of the calculation of partition numbers function W(s, d ^m ) is suggested. We find its zeroes and prove a lemma on the function parity properties. The explicit formulas of W(s, d ^m ) and their periods (G) for the irreducible Coxeter groups and a list for the first twelve symmetric group _m are presented. A least common multiple (m) of the series of the natural numbers 1,2,...,m plays a role in the period ( _m ) of W(s, d ^m) in _m .     

Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have a uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and relevant homomorphisms are also calculable in quadratic time. The algorithm also decides if a finitely generated subgroup has finite index.     

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.     

Bounded Rank Subgroups of Coxeter Groups, Artin Groups and One-Relator Groups with Torsion

We obtain a number of results regarding the freeness of subgroupsof Coxeter groups, Artin groups and one-relator groups withtorsion. In the case of Coxeter groups, we also obtain resultson quasiconvexity and subgroup separability. 2000 MathematicsSubject Classification 20F65, 20F55, 20F36, 20F06.     

On Subgroup Separability in Hyperbolic Coxeter Groups

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

A Characterization of the Simply-Laced FC-Finite Coxeter Groups

We call an element of a Coxeter group fully covering (or a fully covering element) if its length is equal to the number of the elements it covers in the Bruhat ordering. It is easy to see that the notion of fully covering is a generalization of the notion of a 321-avoiding permutation and that a fully covering element is a fully commutative element. Also, we call a Coxeter group bi-full if its fully commutative elements coincide with its fully covering elements. We show that the bi-full Coxeter groups are the ones of type A_n, D_n, E_n with no restriction on n. In other words, Coxeter groups of type E₉, E₁₀,.... are also bi-full. According to a result of Fan, a Coxeter group is a simply-laced FC-finite Coxeter group if and only if it is a bi-full Coxeter group.AMS Subject Classification: 06A07, 20F55.     

Universal Reflection Subgroups and Exponential Growth in Coxeter Groups

We investigate the imaginary cone in hyperbolic Coxeter systems in order to show that any Coxeter system contains universal reflection subgroups of arbitrarily large rank. Furthermore, in the hyperbolic case, the positive spans of the simple roots of the universal reflection subgroups are shown to approximate the imaginary cone (using an appropriate topology on the set of roots), answering a question due to Dyer [9 Dyer , M. Imaginary Cone and Reflection Subgroups of Coxeter Groups. Preprint: http://arXiv.org/abs/1210.5206  [Google Scholar]] in the special case of hyperbolic Coxeter systems. Finally, we discuss growth in Coxeter systems and utilize the previous results to extend the results of [16 Viswanath , S. ( 2008 ). On growth types of quotients of Coxeter groups by parabolic subgroups . Comm. Algebra 36 ( 2 ): 796 – 805 .[Taylor &; Francis Online] , [Google Scholar]] regarding exponential growth in parabolic quotients in Coxeter groups.     

On coherence of graph products of groups and Coxeter groups

Graph products of groups and Coxeter groups are defined via vertex-edge-labeled graphs. We show that if the graph has a special shape, then the corresponding group is coherent, i.e. every finitely generated subgroup is finitely presented.     

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.     

Dense subsets of the boundary of a Coxeter system

In this paper, we investigate dense subsets of the boundary of a Coxeter system. We show that for a Coxeter system , if is quasi-dense in and the order for some , then there exists a point in the boundary of the Coxeter system such that the orbit is dense in . Here . We also show that if the set is quasi-dense in , then is dense in .

     

Reflection Independence in Even Coxeter Groups

If (W,S) is a Coxeter system, then an element of W is a reflection if it is conjugate to some element of S. To each Coxeter system there is an associated Coxeter diagram. A Coxeter system is called reflection preserving if every automorphism of W preserves reflections in this Coxeter system. As a direct application of our main theorem, we classify all reflection preserving even Coxeter systems. More generally, if (W,S) is an even Coxeter system, we give a combinatorial condition on the diagram for (W,S) that determines whether or not two even systems for W have the same set of reflections. If (W,S) is even and (W,S) is not even, then these systems do not have the same set of reflections. A Coxeter group is said to be reflection independent if any two Coxeter systems (W,S) and (W,S) have the same set of reflections. We classify all reflection independent even Coxeter groups.Mathematics Subject Classifications (2000). 20F05, 20F55, 20F65, 51F15.     

Addendum to ``Dense subsets of the boundary of a Coxeter system'

In this paper, we investigate boundaries of parabolic subgroups of Coxeter groups. Let be a Coxeter system and let be a subset of such that the parabolic subgroup is infinite. Then we show that if a certain set is quasi-dense in , then is dense in the boundary of the Coxeter system , where is the boundary of .