Related papers: On the Cyclically Fully Commutative Elements of Co…

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…

Let $G$ be a simply connected simple algebraic group over $\mathbb{C}$, $B$ and $B_-$ be its two opposite Borel subgroups. For two elements $u$, $v$ of the Weyl group $W$, it is known that the coordinate ring ${\mathbb C}[G^{u,v}]$ of the…

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…

We study the Hecke algebra $\H(\bq)$ over an arbitrary field $\FF$ of a Coxeter system $(W,S)$ with independent parameters $\bq=(q_s\in\FF:s\in S)$ for all generators. This algebra is always linearly spanned by elements indexed by the…

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…

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…

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 state combinatorial formulas for hyperoctahedral group ($\mathfrak B_n$) character evaluations of the form $\chi( {{\widetilde C}_w}^{\negthickspace\negthickspace BC}\negthickspace(1))$, where ${{\widetilde…

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…

Let W be an arbitrary Coxeter group of simply-laced type (possibly infinite but of finite rank), u,v be any two elements in W, and i be a reduced word (of length m) for the pair (u,v) in the Coxeter group W\times W. We associate to i a…

We investigate the compatibility of the set of fully commutative elements of a Coxeter group with the various types of Kazhdan-Lusztig cells using a canonical basis for a generalized version of the Temperley-Lieb algebra.

We classify fully commutative elements in the affine Coxeter group of type $\tilde{A_{n}}$. We give a normal form for such elements, then we propose an application of this normal form: we lift these fully commutative elements to the affine…

We refine a conjecture by Lehrer and Solomon on the structure of the Orlik-Solomon algebra of a finite Coxeter group $W$ and relate it to the descent algebra of $W$. As a result, we claim that both the group algebra of $W$, as well as the…

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…

We define a tower of injections of $\tilde{C}$-type Coxeter groups $W(\tilde C_{n})$ for $n\geq 1$. We define a tower of Hecke algebras and we use the faithfulness at the Coxeter level to show that this last tower is a tower of injections.…

Let $(W, R)$ be a Coxeter system and let $w \in W$. We say that $u$ is a prefix of $w$ if there is a reduced expression for $u$ that can be extended to one for $w$. That is, $w = uv$ for some $v$ in $W$ such that $\ell(w) = \ell(u) +…

We prove universal (case-free) formulas for the weighted enumeration of factorizations of Coxeter elements into products of reflections valid in any well-generated reflection group $W$, in terms of the spectrum of an associated operator,…

Let $\mathfrak{S}(\underline{s},w)$ be the graph whose vertices are all subexpressions with target $w$ of a fixed expression $\underline{s}$ in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2.…

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

The purpose of this article is to shed new light on the combinatorial structure of Kazhdan-Lusztig cells in infinite Coxeter groups $W$. Our main focus is the set $\D$ of distinguished involutions in $W$, which was introduced by Lusztig in…