Related papers: Powers of Coxeter elements with unbounded reflecti…

We introduce stable reflection length in Coxeter groups, as a way to study the asymptotic behaviour of reflection length. This creates connections to other well-studied stable length functions in groups, namely stable commutator length and…

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…

The reflection length of an element of a Coxeter group is the minimal number of conjugates of the standard generators whose product is equal to that element. In this paper we prove the conjecture of McCammond and Petersen that reflection…

In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple…

In a discrete group generated by hyperplane reflections in the $n$-dimensional hyperbolic space, the reflection length of an element is the minimal number of hyperplane reflections in the group that suffices to factor the element. For a…

We use geometry of Davis complex of a Coxeter group to prove the following result: if G is an infinite indecomposable Coxeter group and $H\subset G$ is a finite index reflection subgroup then the rank of H is not less than the rank of G.…

Reflection length and codimension of fixed point spaces induce partial orders on a complex reflection group. While these partial orders are of independent combinatorial interest, our investigation is motivated by a connection between the…

Given an irreducible well-generated complex reflection group W with Coxeter number h, we call a Coxeter element any regular element (in the sense of Springer) of order h in W; this is a slight extension of the most common notion of Coxeter…

In this article, we first show that in case $n$ is even which Coxeter element in $\mathfrak{S}_{n}$ affords the longest by taking its power to $n/2$. We also show that in case $n$ is odd which Coxeter element affords the longest in…

We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…

We give a criterion for a finitely generated odd-angled Coxeter group to have a proper finite index subgroup generated by reflections. The answer is given in terms of the least prime divisors of the exponents of the Coxeter relations.

A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections…

Let W be an infinite irreducible Coxeter group with (s_1, ..., s_n) the simple generators. We give a simple proof that the word s_1 s_2 ... s_n s_1 s_2 >... s_n ... s_1 s_2 ... s_n is reduced for any number of repetitions of s_1 s_2 >...…

The excess of an element $w$ of a finite Coxeter group $W$ is the minimal value of $l(x) + l(y) - l(w)$, where $x$, $y$ are elements of $W$ such that $x^2 = y^2 = 1$ and $w = xy$. Every element of a finite Coxeter group is either an…

In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…

We continue the study of freely braided elements of simply laced Coxeter groups, which we introduced in a previous work (math.CO/0301104). A known upper bound for the number of commutation classes of reduced expressions for an element of a…

We extend the usual notion of fully commutative elements from the Coxeter groups to the complex reflection groups. Then we decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties,…

Let $(W,S)$ be a Coxeter system and $\Gamma$ be a group of automorphisms of $W$ such that $\gamma(S)=S$ for all $\gamma \in \Gamma$. Then it is known that the group of fixed points $W^\Gamma$ is again a Coxeter group with a canonically…