English
Related papers

Related papers: A note on involution prefixes in Coxeter groups

200 papers

We study the restriction of the absolute order on a Coxeter group $W$ to an interval $[1,w]_T$, where $w\in W$ is an involution. We characterize and classify those involutions $w$ for which $[1,w]_T$ is a lattice, using the notion of…

Group Theory · Mathematics 2026-01-14 Thomas Gobet

If $x$ and $y$ are roots in the root system with respect to the standard (Tits) geometric realization of a Coxeter group $W$, we say that $x$ \emph{dominates} $y$ if for all $w\in W$, $wy$ is a negative root whenever $wx$ is a negative…

Representation Theory · Mathematics 2012-08-07 Xiang Fu

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…

Group Theory · Mathematics 2007-05-23 Michael L. Mihalik , Steven Tschantz

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 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

The reduced expressions for a given element $w$ of a Coxeter group $(W, S)$ can be regarded as the vertices of a directed graph $\mathcal{R}(w)$; its arcs correspond to the braid moves. Specifically, an arc goes from a reduced expression…

Combinatorics · Mathematics 2026-04-14 Darij Grinberg , Alexander Postnikov

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

Let $(W,S)$ be a Coxeter system and let $w \mapsto w^*$ be an involution of $W$ which preserves the set of simple generators $S$. Lusztig and Vogan have recently shown that the set of twisted involutions (i.e., elements $w \in W$ with…

Representation Theory · Mathematics 2014-05-30 Eric Marberg

Let $(W,S)$ be any Coxeter system and let $w \mapsto w^*$ be an involution of $W$ which preserves the set of simple generators $S$. Lusztig and Vogan have shown that the corresponding set of twisted involutions (i.e., elements $w \in W$…

Representation Theory · Mathematics 2014-06-05 Eric Marberg

We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…

Combinatorics · Mathematics 2017-11-22 Eric Marberg

We introduce a notion of "freely braided element" for simply laced Coxeter groups. We show that an arbitrary group element $w$ has at most $2^{N(w)}$ commutation classes of reduced expressions, where $N(w)$ is a certain statistic defined in…

Combinatorics · Mathematics 2007-05-23 R. M. Green , J. Losonczy

A hereditary property of quivers is a property preserved by restriction to any full subquiver. Similarly, a mutation-invariant property of quivers is a property preserved by mutation. Using forks, a class of quivers developed by M.…

Combinatorics · Mathematics 2024-01-29 Tucker J. Ervin

For an infinite Coxeter system, one can extend the weak right order to the set of infinite reduced words. This is called limit weak order. In [Transformation Groups 18(1), 2013, 179-231], Lam and Pylyavskyy showed that for affine Weyl…

Group Theory · Mathematics 2021-01-12 Weijia Wang

The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…

Group Theory · Mathematics 2025-02-25 Robert Nicolaides , Peter Rowley

Certain results on representations of quivers have analogs in the structure theory of general Coxeter groups. A fixed Coxeter element turns the Coxeter graph into an acyclic quiver, allowing for the definition of a preprojective root. A…

Group Theory · Mathematics 2017-02-08 Mark Kleiner

Two partial orders on a reflection group, the codimension order and the prefix order, are together called the absolute order when they agree. We show that in this case the absolute order on a complex reflection group has the strong Sperner…

Combinatorics · Mathematics 2020-11-03 Christian Gaetz , Yibo Gao

The character of every irreducible finite-dimensional representation of a simple Lie algebra has the highest weight property. The invariance of the character under the action of the Weyl group W implies that there is a similar "extremal…

Quantum Algebra · Mathematics 2025-09-18 Edward Frenkel , David Hernandez

The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…

Combinatorics · Mathematics 2025-04-08 Elizabeth Milićević

Consider a graph with vertex set S. A word in the alphabet S has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph neighbours. For a Coxeter graph, words represent group elements.…

Combinatorics · Mathematics 2008-11-27 Henrik Eriksson , Kimmo Eriksson

For a Coxeter system $(W,S)$ let $a_n^{(W,S)}$ be the cardinality of the sphere of radius $n$ in the Cayley graph of $W$ with respect to the standard generating set $S$. It is shown that, if $(W,S)\preceq(W',S')$ then $a_n^{(W,S)}\leq…

Group Theory · Mathematics 2018-11-28 T. Terragni