English
Related papers

Related papers: A note on involution prefixes in Coxeter groups

200 papers

In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…

Group Theory · Mathematics 2026-05-06 Yeeka Yau

In this paper we describe a family of isomorphism invariants of a finitely generated Coxeter group W. Each of these invariants is the isomorphism type of a quotient group W/N of W by a characteristic subgroup N. The virtue of these…

Group Theory · Mathematics 2007-05-23 Michael Mihalik , John Ratcliffe , Steven Tschantz

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…

Representation Theory · Mathematics 2014-06-16 Mikhail V. Belolipetsky , Paul E. Gunnells

An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…

Combinatorics · Mathematics 2014-07-23 Frédéric Jouhet , Philippe Nadeau

In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the…

Group Theory · Mathematics 2026-04-22 Fabricio Dos Santos , Christophe Hohlweg , Aleksandr Trufanov

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

Let $(W,R)$ be an arbitrary Coxeter system. We determine the number of elements of $W$ that have a unique reduced expression.

Group Theory · Mathematics 2017-01-09 Sarah Hart

Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic…

Combinatorics · Mathematics 2024-02-12 Tomas Boothby , Jeffrey Burkert , Morgan Eichwald , R. M. Green , Dana C. Ernst , Matthew Macauley

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. In the present work, we focus on fully commutative involutions,…

Combinatorics · Mathematics 2015-05-15 Riccardo Biagioli , Frédéric Jouhet , Philippe Nadeau

Let $(W,S)$ be a Coxeter system and $\ast$ be an automorphism of $W$ with order $\leq 2$ such that $s^{\ast}\in S$ for any $s\in S$. Let $I_{\ast}$ be the set of twisted involutions relative to $\ast$ in $W$. In this paper we consider the…

Combinatorics · Mathematics 2016-11-11 Jun Hu , Jing Zhang

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

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

We consider the question of determining whether a given group (especially one generated by involutions) is a right-angled Coxeter group. We describe a group invariant, the involution graph, and we characterize the involution graphs of…

Group Theory · Mathematics 2016-08-03 Charles Cunningham , Andy Eisenberg , Adam Piggott , Kim Ruane

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

Let W be a Coxeter group. In this paper, we establish that, up to going to some finite index normal subgroup W_0 of W, any two cyclically reduced expressions of conjugate elements of W_0 only differ by a sequence of braid relations and…

Group Theory · Mathematics 2014-04-01 Timothée Marquis

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…

Group Theory · Mathematics 2018-07-24 Bernhard Mühlherr , Koji Nuida

We prove two extensions of Hansson and Hultman's word property for certain analogues of reduced words associated to twisted involutions in Coxeter groups. Our first extension concerns the superset of such words in which terms with a natural…

Combinatorics · Mathematics 2023-01-05 Eric Marberg

We investigate which Weyl groups have a Coxeter presentation and which of them at least have the presentation by conjugation with respect to their root system. For most concepts of root systems the Weyl group has both. In the context of…

Group Theory · Mathematics 2007-05-23 Georg Hofmann

In [APS], the authors characterize the partitions of $n$ whose corresponding representations of $S_n$ have nontrivial determinant. The present paper extends this work to all irreducible finite Coxeter groups $W$. Namely, given a nontrivial…

Representation Theory · Mathematics 2017-10-10 Debarun Ghosh , Steven Spallone

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