Related papers: Depth in classical Coexter groups
Petersen and Tenner defined the depth statistic for Coxeter group elements which, in the symmetric group, can be described in terms of a cost function on transpositions. We generalize that cost function to the other classical (finite and…
In well-known work, Kazhdan and Lusztig (1979) defined a new set of Hecke algebra basis elements (actually two such sets) associated to elements in any Coxeter group. Often these basis elements are computed by a standard recursive algorithm…
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…
For Coxeter groups with sufficiently large braid relations, we prove that the sequence of powers of a Coxeter element has unbounded reflection length. We establish a connection between the reflection length functions on arbitrary Coxeter…
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 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 descent algebra of finite Coxeter groups is studied by many famous mathematicians like Bergeron, Brown, Howlett, or Reutenauer. Blessenohl, Hohlweg, and Schocker, for example, proved a symmetry property of the descent algebra, when it…
We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…
In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is…
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…
The depth rule is a level truncation of tensor product coefficients expected to be sufficient for the evaluation of fusion coefficients. We reformulate the depth rule in a precise way, and show how, in principle, it can be used to calculate…
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…
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…
A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…
We introduce the annex of an element $x$ in a Coxeter group as the set of elements $y$ such that $x \nleq y$ with respect to Bruhat order. This notion provides a complementary perspective to the study of Bruhat intervals and their…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group element raises the question of how to enumerate the reduced expressions of an arbitrary Coxeter group element. We provide a framework for…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
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…
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…