English
Related papers

Related papers: On the length of fully commutative elements

200 papers

Let $\mathcal{W}$ be the set of strongly real elements of $W$, a Coxeter group. Then for $w \in \mathcal{W}$, $e(w)$, the excess of $w$, is defined by $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, x^2 = y^2 = 1\}$. When $W$ is…

Group Theory · Mathematics 2014-05-13 Sarah B. Hart , Peter J. Rowley

Let g be a simple Lie algebra, with fixed Borel subalgebra b and with Weyl group W. Expanding on previous work of Fan and Stembridge in the simply laced case, this note aims to study the fully commutative elements of W, and their…

Representation Theory · Mathematics 2022-07-21 Jacopo Gandini

Let $W$ be a Coxeter group of type $\widetilde{A}_{n-1}$. We show that the leading coefficient, $\mu(x, w)$, of the Kazhdan--Lusztig polynomial $P_{x, w}$ is always equal to 0 or 1 if $x$ is fully commutative (and $w$ is arbitrary).

Quantum Algebra · Mathematics 2008-01-11 R. M. Green

For $W$ a Coxeter group, let $\mathcal{W} = \{ w \in W \;| \; w = xy \; \mbox{where} \; x, y \in W \; \mbox{and} \; x^2 = 1 = y^2 \}$. If $W$ is finite, then it is well known that $W = \mathcal{W}$. Suppose that $w \in \mathcal{W}$. Then…

Group Theory · Mathematics 2014-05-14 Sarah B. Hart , Peter J. Rowley

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

Group Theory · Mathematics 2015-03-05 Van Minh Nguyen

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…

Group Theory · Mathematics 2014-02-26 Kamil Duszenko

We produce an explicit recursive formula which computes the idempotent projecting to any indecomposable Soergel bimodule for a universal Coxeter system. This gives the exact set of primes for which the positive characteristic analogue of…

Representation Theory · Mathematics 2017-01-11 Ben Elias , Nicolas Libedinsky

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…

Group Theory · Mathematics 2024-06-11 Marco Lotz

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

Group Theory · Mathematics 2026-05-06 Yeeka Yau

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

Group Theory · Mathematics 2014-02-26 Gustavo A. Fernández-Alcober , Marta Morigi

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…

Group Theory · Mathematics 2025-04-02 Francesco Fournier-Facio , Marco Lotz , Timothée Marquis

With a nilpotent element in a semisimple Lie algebra g one associates a finitely generated associative algebra W called a W-algebra of finite type. This algebra is obtained from the universal enveloping algebra U(g) by a certain Hamiltonian…

Representation Theory · Mathematics 2010-06-03 Ivan Losev

Frobenius observed that the number of times an element of a finite group is obtained as a commutator is given by a specific combination of the irreducible characters of the group. More generally, for any word w the number of times an…

Group Theory · Mathematics 2014-03-26 Ori Parzanchevski , Gili Schul

For any permutation w, we characterize the reduced words of w that are their own commutation class. When w is the long element n(n-1)...321 and n \ge 4, there are exactly four such words.

Combinatorics · Mathematics 2023-05-19 Bridget Eileen Tenner

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…

Combinatorics · Mathematics 2026-04-14 Darij Grinberg , Alexander Postnikov

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…

Combinatorics · Mathematics 2015-07-03 Henri Mühle

We study different problems related to the Solomon's descent algebra $\Sigma(W)$ of a finite Coxeter group $(W,S)$: positive elements, morphisms between descent algebras, Loewy length... One of the main result is that, if $W$ is irreducible…

Representation Theory · Mathematics 2008-05-30 Cédric Bonnafé , Götz Pfeiffer

For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…

Combinatorics · Mathematics 2007-05-23 Thomas Brady , Colum Watt

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

Combinatorics · Mathematics 2025-05-20 Joel Brewster Lewis , Jiayuan Wang

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…

Discrete Mathematics · Computer Science 2011-08-19 Matthew J. Samuel