English
Related papers

Related papers: W-graph determining elements in type A

200 papers

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

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

In this article, we investigate the set of $\gamma$-sortable elements, associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, under Bruhat order, and we denote this poset by $\mathcal{B}_{\gamma}$. We show that this poset…

Combinatorics · Mathematics 2015-06-11 Henri Mühle

This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to…

Group Theory · Mathematics 2019-08-15 Matthew Dyer

Admissible W-graphs were defined and combinatorially characterised by Stembridge in reference [12]. The theory of admissible W-graphs was motivated by the need to construct W-graphs for Kazhdan-Lusztig cells, which play an important role in…

Representation Theory · Mathematics 2018-08-24 Van Minh Nguyen

We study different problems related to the Solomon's descent algebra $\Sigma(W)$ of a finite Coxeter group $(W,S)$: positive elements, morphisms between descent algebras, Loewy length... One of the main result is that, if $W$ is irreducible…

Representation Theory · Mathematics 2008-05-30 Cédric Bonnafé , Götz Pfeiffer

In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…

Combinatorics · Mathematics 2015-07-03 Henri Mühle

A word-graph Gw is a digraph represented by a word w such that the vertex-set V(Gw) is the alphabet of w and the edge-set E(Gw) is determined by non-identical adjacent letter pairs in w. In this paper we study the strong-connectivity of…

Combinatorics · Mathematics 2011-08-31 Edward J. L. Bell , Damon Berridge , Paul Rayson

Given an arbitrary Coxeter system $(W,S)$ and a nonnegative integer $m$, the $m$-Shi arrangement of $(W,S)$ is a subarrangement of the Coxeter hyperplane arrangement of $(W,S)$. The classical Shi arrangement ($m=0$) was introduced in the…

Combinatorics · Mathematics 2024-12-13 Matthew Dyer , Christophe Hohlweg , Susanna Fishel , Alice Mark

We introduce ring theoretic constructions that are similar to the construction of wreath product of groups. In particular, for a given graph $\Gamma=(V,E)$ and an associate algebra $A,$ we construct an algebra $B=A\, wr\, L(\Gamma)$ with…

Rings and Algebras · Mathematics 2014-08-08 Adel Alahmadi , Hamed Alsulami

Lie-theoretic structures of type $E_8$ (e.g., Lie groups and algebras, Hecke algebras and Kazhdan-Lusztig cells, ...) are considered to serve as a `gold standard' when it comes to judging the effectiveness of a general algorithm for solving…

Representation Theory · Mathematics 2017-05-09 Meinolf Geck , Jürgen Müller

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

A Gelfand model for an algebra is a module given by a direct sum of irreducible submodules, with every isomorphism class of irreducible modules represented exactly once. We introduce the notion of a perfect model for a finite Coxeter group,…

Representation Theory · Mathematics 2022-10-12 Eric Marberg , Yifeng Zhang

Let W be an arbitrary Coxeter group of simply-laced type (possibly infinite but of finite rank), u,v be any two elements in W, and i be a reduced word (of length m) for the pair (u,v) in the Coxeter group W\times W. We associate to i a…

Algebraic Geometry · Mathematics 2007-05-23 Boris Shapiro , Michael Shapiro , Alek Vainshtein , Andrei Zelevinsky

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

Let $k \geq 1$. A graph $G$ is $\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex subsets $A_1, \dots, A_k$ in $G$, there exist $k$ pairwise disjoint maximum independent sets $S_1, \dots, S_k$ in $G$ such that $A_i \subseteq…

Combinatorics · Mathematics 2023-11-16 Carl Feghali , Malory Marin

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

Parabolic subgroups $W_I$ of Coxeter systems $(W,S)$, as well as their ordinary and double quotients $W / W_I$ and $W_I \backslash W / W_J$, appear in many contexts in combinatorics and Lie theory, including the geometry and topology of…

Combinatorics · Mathematics 2017-12-15 Sara C. Billey , Matjaž Konvalinka , T. Kyle Petersen , William Slofstra , Bridget E. Tenner

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

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