Related papers: Some combinatorial models for reduced expressions …

Let W~ be an affine Weyl group, and let C be a left, right, or two-sided Kazhdan--Lusztig cell in W~. Let Reduced (C) be the set of all reduced expressions of elements of C, regarded as a formal language in the sense of the theory of…

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…

An element of a Coxeter group W is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. An element of a Coxeter group W is cyclically fully commutative if any…

This is the second in a series of papers developing a theory of total positivity for loop groups. In this paper, we study infinite products of Chevalley generators. We show that the combinatorics of infinite reduced words underlies the…

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…

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

For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The…

Any two reduced expressions for the same Coxeter group element are related by a sequence of commutation and braid moves. Two reduced expressions are said to be braid equivalent if they are related via a sequence of braid moves. Braid…

We classify the elements of $W(\tilde{A}_n)$ by giving a canonical reduced expression for each, using basic tools among which affine length. We give some direct consequences for such a canonical form: a description of left multiplication by…

Folding subgroups give a way to realize non-simply-laced Coxeter groups as subgroups of simply-laced Coxeter groups. In this paper, we study how folding subgroups of finite and affine type are distributed length-wise by calculating the…

We define ``star reducible'' Coxeter groups to be those Coxeter groups for which every fully commutative element (in the sense of Stembridge) is equivalent to a product of commuting generators by a sequence of length-decreasing star…

We derive presentations of the interval groups related to all quasi-Coxeter elements in the Coxeter group of type $D_n$. Type $D_n$ is the only infinite family of finite Coxeter groups that admits proper quasi-Coxeter elements. The…

Given an involutive automorphism $\theta$ of a Coxeter system $(W,S)$, let $\mathfrak{I}(\theta) \subseteq W$ denote the set of twisted involutions. We provide a minimal set of moves that can be added to the braid moves, in order to connect…

The combinatorics of reduced words and commutation classes plays an important role in geometric representation theory. A string polytope is a lattice polytope associated to each reduced word of the longest element $w_0$ in the symmetric…

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…

We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…

In Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…

Let $W_a$ be an affine Weyl group and $\eta:W_a\longrightarrow W_0$ be the natural projection to the corresponding finite Weyl group. We say that $w\in W_a$ has finite Coxeter part if $\eta(w)$ is conjugate to a Coxeter element of $W_0$.…

For an infinite Coxeter system, one can extend the weak right order to the set of infinite reduced words. This is called limit weak order. In [Transformation Groups 18(1), 2013, 179-231], Lam and Pylyavskyy showed that for affine Weyl…