Related papers: Some combinatorial models for reduced expressions …

Let W be a Coxeter group. In this paper, we establish that, up to going to some finite index normal subgroup W_0 of W, any two cyclically reduced expressions of conjugate elements of W_0 only differ by a sequence of braid relations and…

In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…

We continue the study of the maximally clustered elements for simply laced Coxeter groups which were recently introduced by Losonczy. Such elements include as a special case the freely braided elements of Losonczy and the author, which in…

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…

We give a geometric proof that minimal length elements in a (twisted) conjugacy class of a finite Coxeter group $W$ have remarkable properties with respect to conjugation, taking powers in the associated Braid group and taking centralizer…

We describe an approach, via Malle's permutation $\Psi$ on the set of irreducible characters $\text{Irr}(W)$, that gives a uniform derivation of the Chapuy-Stump formula for the enumeration of reflection factorizations of the Coxeter…

We enlarge a Coxeter group into a category, with one object for each finite parabolic subgroup, encoding the combinatorics of double cosets. This category, the singular Coxeter monoid, is connected to the geometry of partial flag varieties.…

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…

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 [APS], the authors characterize the partitions of $n$ whose corresponding representations of $S_n$ have nontrivial determinant. The present paper extends this work to all irreducible finite Coxeter groups $W$. Namely, given a nontrivial…

We discuss metric and combinatorial properties of Thompson's group T, including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson's group F when possible, and highlight…

Let $W$ denote a simply-laced Coxeter group with $n$ generators. We construct an $n$-dimensional representation $\phi$ of $W$ over the finite field $F_2$ of two elements. The action of $\phi(W)$ on $F_2^n$ by left multiplication is…

We review Stanley's seminal work on the number of reduced words of the longest element of the symmetric group and his Stanley symmetric functions. We shed new light on this by giving a crystal theoretic interpretation in terms of decreasing…

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

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…

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…

The reduced expressions for a given element $w$ of a Coxeter group $(W, S)$ can be regarded as the vertices of a directed graph $\mathcal{R}(w)$; its arcs correspond to the braid moves. Specifically, an arc goes from a reduced expression…

Let $F_2$ be the free group on two generators and let $H$ be a subgroup of $F_2$. We investigate a method for calculating the number of elements in a coset of $H$ that have a given length when written in reduced form. More specifically,…

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…