English
Related papers

Related papers: Zero Excess and Minimal Length in Finite Coxeter G…

200 papers

For a finite Coxeter group $W$ and $w$ an element of $W$ the `excess' of $w$ is defined to be $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, \; x^2 = y^2 = 1\}$ where $\ell$ is the length function on $W$. Here we investigate the…

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

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…

Group Theory · Mathematics 2015-08-28 Sarah B. Hart , Peter J. Rowley

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

Representation Theory · Mathematics 2012-03-22 Xuhua He , Zhongwei Yang

For a Coxeter group $W$ with length function $\ell$, the excess zero graph $\mathcal{E}_0(W)$ has vertex set the non-identity involutions of $W$, with two involutions $x$ and $y$ adjacent whenever $\ell(xy)=\ell(x)+\ell(y)$. Properties of…

Group Theory · Mathematics 2025-04-23 Sarah Hart , Veronica Kelsey , Peter Rowley

Let $W$ be an extended affine Weyl group. We prove that minimal length elements $w_{\co}$ of any conjugacy class $\co$ of $W$ satisfy some special properties, generalizing results of Geck and Pfeiffer \cite{GP} on finite Weyl groups. We…

Representation Theory · Mathematics 2019-02-20 Xuhua He , Sian Nie

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…

Group Theory · Mathematics 2007-05-23 W. N. Franzsen , R. B. Howlett , B. Mühlherr

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…

Group Theory · Mathematics 2025-07-08 Timothée Marquis

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…

Representation Theory · Mathematics 2019-12-19 Xuhua He , Sian Nie

An element w of a Coxeter group W is said to be fully commutative, if any reduced expression of w can be obtained from any other by transposing adjacent pairs of generators. These elements were described in 1996 by Stembridge in the case of…

Combinatorics · Mathematics 2025-04-11 Riccardo Biagioli , Mireille Bousquet-Mélou , Frédéric Jouhet , Philippe Nadeau

Let W be a Weyl group and let w be a Coxeter elememt of minimal length of W. In the early 1970's I.G.Macdonald stated that the trace of w on an irreducible representation of W is 0,1 or -1. In this paper we give a proof of this statement…

Representation Theory · Mathematics 2024-11-28 G. Lusztig

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…

Combinatorics · Mathematics 2010-10-25 Jon McCammond , T. Kyle Petersen

Let $W$ be a finite Coxeter group. We classify the reflection subgroups of $W$ up to conjugacy and give necessary and sufficient conditions for the map that assigns to a reflection subgroup $R$ of $W$ the conjugacy class of its Coxeter…

Group Theory · Mathematics 2012-01-26 J. Matthew Douglass , Goetz Pfeiffer , Gerhard Roehrle

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

Given a reflection $r$ in a Coxeter group $W$ (possibly of infinite rank), we consider the subgroup of $W$ generated by the reflections in $W$ having (-1)-eigenvectors orthogonal to the (-1)-eigenvector of $r$. In this paper, we determine…

Group Theory · Mathematics 2012-01-18 Koji Nuida

A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this…

Group Theory · Mathematics 2007-05-23 Koji Nuida

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

Group Theory · Mathematics 2025-02-04 Sarah B. Hart , Peter J. Rowley

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…

Combinatorics · Mathematics 2014-12-16 Victor Reiner , Vivien Ripoll , Christian Stump

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

In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…

Combinatorics · Mathematics 2015-11-30 Philippe Nadeau
‹ Prev 1 2 3 10 Next ›