Related papers: Computing reflection length in an affine Coxeter g…

There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…

We present results underlining the conjecture that affine extensions for non-crystallographic Coxeter groups are suitable mathematical objects for the description of the symmetries of Carbon onions and Carbon nanotubes. It is the hope that…

We define the excedance number on the complex reflection groups and compute its multidistribution with the number of fixed points on the set of involutions in these groups. We use some recurrence formulas and generating functions…

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…

Let $(W,S)$ be a Coxeter system and let $s \in S$. We call $s$ a right-angled generator of $(W,S)$ if $st = ts$ or $st$ has infinite order for each $t \in S$. We call $s$ an intrinsic reflection of $W$ if $s \in R^W$ for all Coxeter…

For any Coxeter group W, we define a filtration of H^*(W;ZW) by W-submodules and then compute the associated graded terms. More generally, if U is a CW complex on which W acts as a reflection group we compute the associated graded terms for…

A finite subgroup of $GL(n,\mathbb C)$ is involutory if the sum of the dimensions of its irreducible complex representations is given by the number of absolute involutions in the group. A uniform combinatorial model is constructed for all…

Let $G$ be a simple algebraic group over an algebraically closed field $\mathbb{F}$ of characteristic $p\geq h$, the Coxeter number of $G$. We observe an easy `recursion formula' for computing the Jantzen sum formula of a Weyl module with…

The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…

We study the conjugacy class growth function in finitely generated virtually abelian groups. That is, the number of elements in the ball of radius $n$ in the Cayley graph which intersect a fixed conjugacy class. In the class of virtually…

This paper gives a definitive solution to the problem of describing conjugacy classes in arbitrary Coxeter groups in terms of cyclic shifts. Let $(W,S)$ be a Coxeter system. A cyclic shift of an element $w\in W$ is a conjugate of $w$ of the…

A Coxeter group admits infinite-dimensional irreducible complex representations if and only if it is not finite or affine. In this paper, we provide a construction of some of those representations for certain Coxeter groups using some…

Let $W$ be a Coxeter group and $r\in W$ a reflection. If the group of order 2 generated by $r$ is the intersection of all the maximal finite subgroups of $W$ that contain it, then any isomorphism from $W$ to a Coxeter group $W'$ must take…

We use probabilistic methods to prove that many Coxeter groups are incoherent. In particular, this holds for Coxeter groups of uniform exponent > 2 with sufficiently many generators.

We introduce a new method for computing the word length of an element of Thompson's group F with respect to a "consecutive" generating set of the form X_n={x_0,x_1,...,x_n}, which is a subset of the standard infinite generating set for F.…

Orbits of the Weyl reflection groups attached to the simple Lie groups $A_2, C_2, G_2$ and Coxeter group $H_2$ are considered. For each of the groups products of any two orbits are decomposed into the union of the orbits. Results are…

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…

In this article, we study two combinatorial problems concerning the set of reflections of a Coxeter system. The first problem asks whether the language of palindromic reduced words for reflections is regular, and the second is about finding…

An elementary approach to the construction of Coxeter group representations is presented.

For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by length and below by the average of length and reflection…