Related papers: Powers of Coxeter elements with unbounded reflecti…

The depth statistic was defined by Petersen and Tenner for an element of an arbitrary Coxeter group in terms of factorizations of the element into a product of reflections. It can also be defined as the minimal cost, given certain…

In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…

For a finite Coxeter group $W$ and $w$ an element of $W$ the `excess' of $w$ is defined to be $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, \; x^2 = y^2 = 1\}$ where $\ell$ is the length function on $W$. Here we investigate the…

In this paper we prove, without the finite rank assumption, that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group. The key ingredient of the proof is that we can determine, for an irreducible…

On etudie divers aspects d'une formule qui compte les reflexions pleines dans les groupes de Coxeter finis. ***** We study several points about a formula which counts reflexions in a finite Coxeter group whose reduced decompositions involve…

Two partial orders on a reflection group, the codimension order and the prefix order, are together called the absolute order when they agree. We show that in this case the absolute order on a complex reflection group has the strong Sperner…

In this article, we study two combinatorial problems concerning the set of reflections of a Coxeter system. The first problem asks whether the language of palindromic reduced words for reflections is regular, and the second is about finding…

The following results are proved: The center of any finite index subgroup of an irreducible, infinite, non-affine Coxeter group is trivial; Any finite index subgroup of an irreducible, infinite, non-affine Coxeter group cannot be expressed…

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

We give a new presentation of the braid group $B$ of the complex reflection group $G(e,e,r)$ which is positive and homogeneous, and for which the generators map to reflections in the corresponding complex reflection group. We show that this…

Let $(W,R)$ be an arbitrary Coxeter system. We determine the number of elements of $W$ that have a unique reduced expression.

The principal objects studied in this note are Coxeter groups $W$ that are neither finite nor affine. A well known result of de la Harpe asserts that such groups have exponential growth. We consider quotients of $W$ by its parabolic…

We show how Coxeter's work implies a bijection between complex reflection groups of rank two and real reflection groups in $O(3)$. We also consider this magic square of reflections and rotations in the framework of Clifford algebras: we…

The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…

An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…

We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…

When the standard representation of a crystallographic Coxeter group is reduced modulo an odd prime p, one obtains a finite group G^p acting on some orthogonal space over Z_p . If the Coxeter group has a string diagram, then G^p will often…

The weak order is a classical poset structure on a Coxeter group; it is a lattice when the group is finite but merely a meet-semilattice when the group is infinite. Motivated by problems in Kazhdan--Lusztig theory, Matthew Dyer introduced…

We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are…

For each positive integer $k$ we present an example of Coxeter system $(G_k,S_k)$ such that $G_k$ is a word-hyperbolic Coxeter group, for any two generating reflections $s,t\in S_k$ the product $st$ has finite order, and the Coxeter graph…