English
Related papers

Related papers: The Deletion Order and Coxeter Groups

200 papers

Suppose that $W$ is a finite Coxeter group and $W_J$ a standard parabolic subgroup of $W$. The main result proved here is that for any for any $w \in W$ and reduced expression of $w$ there is an Elnitsky tiling of a $2m$-polygon, where $m =…

Group Theory · Mathematics 2024-07-23 Robert Nicolaides , Peter Rowley

A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…

Combinatorics · Mathematics 2013-03-08 Christos A. Athanasiadis , Yuval Roichman

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

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

Combinatorics · Mathematics 2009-03-30 Drew Armstrong

The absolute order is a natural partial order on a Coxeter group W. It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflections in W is played by the set of all reflections in W. By…

Combinatorics · Mathematics 2008-01-07 Christos A. Athanasiadis , Myrto Kallipoliti

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…

Combinatorics · Mathematics 2007-05-23 Claus Mokler

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

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

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

We consider the set $\Irr(W)$ of (complex) irreducible characters of a finite Coxeter group $W$. The Kazhdan--Lusztig theory of cells gives rise to a partition of $\Irr(W)$ into "families" and to a natural partial order $\leq_{\cLR}$ on…

Representation Theory · Mathematics 2010-06-01 Meinolf Geck

In [5], Elnitsky constructed three elegant bijections between classes of reduced words for Type $\mathrm{A}$, $\mathrm{B}$ and $\mathrm{D}$ families of Coxeter groups and certain tilings of polygons. This paper offers a particular…

Group Theory · Mathematics 2024-07-23 Robert Nicolaides , Peter Rowley

The Demazure product gives a natural monoid structure on any Coxeter group. Such structure occurs naturally in many different areas in Lie Theory. This paper studies the Demazure product of an extended affine Weyl group $\tilde W$. The main…

Representation Theory · Mathematics 2021-12-14 Xuhua He , Sian Nie

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

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

Let $\mathfrak{g}$ be a finite dimensional complex simple Lie algebra, $\mathbb{K}$ a commutative field and $q$ a nonzero element of $\mathbb{K}$ which is not a root of unity. To each reduced decomposition of the longest element $w_0$ of…

Quantum Algebra · Mathematics 2009-02-10 Antoine Mériaux

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

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. These elements were extensively studied by Stembridge, in particular…

Combinatorics · Mathematics 2014-02-11 Riccardo Biagioli , Frédéric Jouhet , Philippe Nadeau

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

We define the notion of a climbing element in a finite real reflection group relative to a total order on the reflection set and we characterise these elements in the case where the total order arises from a bipartite Coxeter element.

Combinatorics · Mathematics 2010-05-06 Thomas Brady , Aisling Kenny , And Colum Watt

Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter…

Combinatorics · Mathematics 2010-01-18 Christian Krattenthaler , Thomas Müller
‹ Prev 1 2 3 10 Next ›