A Hecke Algebra Quotient and Some Combinatorial Applications

Let (W, S) be a Coxeter group associated to a Coxeter graph which has no multiple bonds. Let H be the corresponding Hecke Algebra. We define a certain quotient \-H of H and show that it has a basis parametrized by a certain subset W _cof the Coxeter group W. Specifically, W _cconsists of those elements of W all of whose reduced expressions avoid substrings of the form sts where s and t are noncommuting generators in S. We determine which Coxeter groups have finite W _cand compute the cardinality of W _cwhen W is a Weyl group. Finally, we give a combinatorial application (which is related to the number of reduced expressions for w W _cof an exponential formula of Lusztig which utilizes a specialization of a subalgebra of \-H.     

The absolute order of a permutation representation of a Coxeter group

A permutation representation of a Coxeter group W naturally defines an absolute order. This family of partial orders (which includes the absolute order on W) is introduced and studied in this paper. Conditions under which the associated rank generating polynomial divides the rank generating polynomial of the absolute order on W are investigated when W is finite. Several examples, including a symmetric group action on perfect matchings, are discussed. As an application, a well-behaved absolute order on the alternating subgroup of W is defined.     

Boundaries of Coxeter Matroids

The purpose of this paper is to introduce, for a finite Coxeter groupW, the mod 2 boundary operator on the space of all Coxeter matroids (also known asWP-matroids) forWandP, wherePvaries through all the proper standard parabolic subgroups ofW(Theorem 3 of the paper). A remarkably simple interpretation of Coxeter matroids as certain sets of faces of the generalized permutahedron associated with the Coxeter groupW(Theorem 1) yields a natural definition of the boundary of a Coxeter matroid. The latter happens to be a union of Coxeter matroids for maximal standard parabolic subgroupsQ_iofP(Theorem 2). These results have very natural interpretations in the case of ordinary matroids and flag-matroids (Section 3).     

Permutahedra and generalized associahedra

Given a finite Coxeter system (W,S) and a Coxeter element c, or equivalently an orientation of the Coxeter graph of W, we construct a simple polytope whose outer normal fan is N. Reading's Cambrian fan Fc, settling a conjecture of Reading that this is possible. We call this polytope the c-generalized associahedron. Our approach generalizes Loday's realization of the associahedron (a type A c-generalized associahedron whose outer normal fan is not the cluster fan but a coarsening of the Coxeter fan arising from the Tamari lattice) to any finite Coxeter group. A crucial role in the construction is played by the c-singleton cones, the cones in the c-Cambrian fan which consist of a single maximal cone from the Coxeter fan.Moreover, if W is a Weyl group and the vertices of the permutahedron are chosen in a lattice associated to W, then we show that our realizations have integer coordinates in this lattice.     

A subalgebra of 0-Hecke algebra

Let (W,I) be a finite Coxeter group. In the case where W is a Weyl group, Berenstein and Kazhdan in [A. Berenstein, D. Kazhdan, Geometric and unipotent crystals. II. From unipotent bicrystals to crystal bases, in: Quantum Groups, in: Contemp. Math., vol. 433, Amer. Math. Soc., Providence, RI, 2007, pp. 13–88] constructed a monoid structure on the set of all subsets of I using unipotent χ-linear bicrystals. In this paper, we will generalize this result to all types of finite Coxeter groups (including non-crystallographic types). Our approach is more elementary, based on some combinatorics of Coxeter groups. Moreover, we will calculate this monoid structure explicitly for each type.     

The dual braid monoid

We study a new monoid structure for Artin groups associated with finite Coxeter systems. Like the classical positive braid monoid, the new monoid is a Garside monoid. We give several equivalent constructions: algebraically, the new monoid arises when studying Coxeter systems in a “dual” way, replacing the pair (W,S) by (W,T), with T the set of all reflections; geometrically, it arises when looking at the reflection arrangement from a certain basepoint. In the type A case, we recover the monoid constructed by Birman, Ko and Lee.     

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.     

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.     

Chordal Coxeter groups

A solution of the isomorphism problem is presented for the class of Coxeter groups W that have a finite set of Coxeter generators S such that the underlying graph of the presentation diagram of the system (W,S) has the property that every cycle of length at least four has a chord. As an application, we construct counterexamples to two conjectures concerning the isomorphism problem for Coxeter groups.      

Reciprocity of growth functions of Coxeter groups

The growth series W(t) of a Coxeter system (W, S) is always a rational function. We prove that for a very general class of infinite Coxeter groups, this function satisfies W(t ^–1)=±W(t).Partially supported by NSF grant DMS-8905378.     

The Enumeration of Coxeter Elements

Let (W,S, ) be a Coxeter system: a Coxeter group W with S its distinguished generator set and its Coxeter graph. In the present paper, we always assume that the cardinality l=|S| ofS is finite. A Coxeter element of W is by definition a product of all generators s S in any fixed order. We use the notation C(W) to denote the set of all the Coxeter elements in W. These elements play an important role in the theory of Coxeter groups, e.g., the determination of polynomial invariants, the Poincaré polynomial, the Coxeter number and the group order of W (see [1–5] for example). They are also important in representation theory (see [6]). In the present paper, we show that the set C(W) is in one-to-one correspondence with the setC() of all acyclic orientations of . Then we use some graph-theoretic tricks to compute the cardinality c(W) of the setC(W) for any Coxeter group W. We deduce a recurrence formula for this number. Furthermore, we obtain some direct formulae of c(W) for a large family of Coxeter groups, which include all the finite, affine and hyperbolic Coxeter groups.The content of the paper is organized as below. In Section 1, we discuss some properties of Coxeter elements for simplifying the computation of the value c(W). In particular, we establish a bijection between the sets C(W) andC() . Then among the other results, we give a recurrence formula of c(W) in Section 2. Subsequently we deduce some closed formulae of c(W) for certain families of Coxeter groups in Section 3.     

Coxeter–Chein Loops

In 1974, Orin Chein discovered a new family of Moufang loops which are now called Chein loops. Such a loop can be created from any group W together with ?₂ by a variation on a semidirect product. We first settle an open problem, originally proposed by Petr Vojtěchovský in 2003, by finding a minimal presentation for the Chein loop with respect to a presentation for W. We then study these loops in the case where W is a Coxeter group and show that it has what we call a Chein-Coxeter system, a small set of generators of order 2, together with a set of relations closely related to the Coxeter relations and Chein relations. In particular, even if the Moufang loop is infinite, it is finitely presented. Viewing these presentations as amalgams of loops, we then apply methods due to Blok and Hoffman to describe a family of twisted Coxeter–Chein loops.     

On Growth Types of Quotients of Coxeter Groups by Parabolic Subgroups

The principal objects studied in this note are infinite, non-affine Coxeter groups W. A well-known result of de la Harpe asserts that such groups have exponential growth. We study the growth type of quotients of W by parabolic subgroups and by a certain class of reflection subgroups. Our main result is that these quotients have exponential growth as well.     

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.     

Algebraic Topological Closure Operators

For any closure operator c there is a T_o-closure operator whose lattice of closed subsets are isomorphic to that of c. A correspondence between algebraic topological (T_o) closure operators on a nonempty set X and pre-orderes (partial orders) on X is established. Equivalent conditions are obtained for a T_o-lattice to be a complete atomic Boolean algebra and for the lattice of closed subsets of an algebraic topological closure operator to be a complete atomic Boolean algebra. Further it is proved that a complete lattice is an algebraic T_o-lattice if and only if it is isomorphic to the lattice of closed subsets of some algebraic topological closure operator on a suitable set.AMS Subject Classification (1991): 06A23, 54D65.     

The sorting order on a Coxeter group

Let (W,S) be an arbitrary Coxeter system. For each word ω in the generators we define a partial order—called the ω-sorting order—on the set of group elements Wω⊆W that occur as subwords of ω. We show that the ω-sorting order is a supersolvable join-distributive lattice and that it is strictly between the weak and Bruhat orders on the group. Moreover, the ω-sorting order is a “maximal lattice” in the sense that the addition of any collection of Bruhat covers results in a nonlattice.Along the way we define a class of structures called supersolvable antimatroids and we show that these are equivalent to the class of supersolvable join-distributive lattices.     

Generalized Calogero–Moser systems from rational Cherednik algebras

We consider ideals of polynomials vanishing on the W-orbits of the intersections of mirrors of a finite reflection group W. We determine all such ideals that are invariant under the action of the corresponding rational Cherednik algebra hence form submodules in the polynomial module. We show that a quantum integrable system can be defined for every such ideal for a real reflection group W. This leads to known and new integrable systems of Calogero–Moser type which we explicitly specify. In the case of classical Coxeter groups, we also obtain generalized Calogero–Moser systems with added quadratic potential.     

A quiver presentation for Solomon's descent algebra

The descent algebra Σ(W) is a subalgebra of the group algebra QW of a finite Coxeter group W, which supports a homomorphism with nilpotent kernel and commutative image in the character ring of W. Thus Σ(W) is a basic algebra, and as such it has a presentation as a quiver with relations. Here we construct Σ(W) as a quotient of a subalgebra of the path algebra of the Hasse diagram of the Boolean lattice of all subsets of S, the set of simple reflections in W. From this construction we obtain some general information about the quiver of Σ(W) and an algorithm for the construction of a quiver presentation for the descent algebra Σ(W) of any given finite Coxeter group W.     

On outer automorphism groups of coxeter groups

Summary It is shown that the outer automorphism group of a Coxeter groupW of finite rank is finite if the Coxeter graph contains no infinite bonds. A key step in the proof is to show that if the group is irreducible andΠ ₁ andΠ ₂ any two bases of the root system ofW, thenΠ ₂ = ±ωΠ ₁ for some ω εW. The proof of this latter fact employs some properties of the dominance order on the root system introduced by Brink and Howlett. This article was processed by the author using the Springer-Verlag TEX PJour1g macro package 1991.