English
Related papers

Related papers: Intrinsic reflections in Coxeter systems

200 papers

In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple…

Combinatorics · Mathematics 2020-03-02 Joel Brewster Lewis , Jon McCammond , T. Kyle Petersen , Petra Schwer

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

For extra-large Coxeter systems (m(s,r)>3), we construct a natural and explicit set of Soergel bimodules D={D_w}_{w\in W} such that each D_w contains as a direct summand (or is equal to) the indecomposable Soergel bimodule B_w. When…

Representation Theory · Mathematics 2009-07-02 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

Let W be an infinite irreducible Coxeter group with (s_1, ..., s_n) the simple generators. We give a simple proof that the word s_1 s_2 ... s_n s_1 s_2 >... s_n ... s_1 s_2 ... s_n is reduced for any number of repetitions of s_1 s_2 >...…

Combinatorics · Mathematics 2007-10-18 David E Speyer

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…

Group Theory · Mathematics 2014-10-01 Michael Mihalik , John Ratcliffe , Steven Tschantz

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Combinatorics · Mathematics 2024-02-07 Joel Brewster Lewis , Alejandro H. Morales

Let $(W, S)$ be a Coxeter system equipped with a fixed automorphism $\ast$ of order $\leq 2$ which preserves $S$. Lusztig (and with Vogan in some special cases) have shown that the space spanned by set of "twisted" involutions was naturally…

Representation Theory · Mathematics 2015-07-06 Jun Hu , Jing Zhang

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

To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…

Group Theory · Mathematics 2021-03-10 Jacek Świątkowski

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…

Group Theory · Mathematics 2009-04-23 Michael W Davis , Jan Dymara , Tadeusz Januszkiewicz , Boris Okun

Let W be a 2-dimensional right-angled Coxeter group. We characterise such W with linear and quadratic divergence, and construct right-angled Coxeter groups with divergence polynomial of arbitrary degree. Our proofs use the structure of…

Group Theory · Mathematics 2013-06-19 Pallavi Dani , Anne Thomas

Let $(W,S)$ be a Coxeter system, and write $S=\{s_i:i\in I\}$, where $I$ is a finite index set. Fix a nonempty convex subset $\mathscr{L}$ of $W$. If $W$ is of type $A$, then $\mathscr{L}$ is the set of linear extensions of a poset, and…

Combinatorics · Mathematics 2025-05-06 Grant Barkley , Colin Defant , Eliot Hodges , Noah Kravitz , Mitchell Lee

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)\in\{2\}\cup 4\N$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd,…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

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

Let $(W,S)$ be a Coxeter system and suppose that $w \in W$ is fully commutative (in the sense of Stembridge) and has a reduced expression beginning (respectively, ending) with $s \in S$. If there exists $t\in S$ such that $s$ and $t$ do not…

Combinatorics · Mathematics 2018-01-04 Dana C. Ernst

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is…

Combinatorics · Mathematics 2015-06-12 Guillaume Chapuy , Christian Stump

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

For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter…

Combinatorics · Mathematics 2013-02-13 Henrik Eriksson , Kimmo Eriksson

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