Related papers: W-graph determining elements in type A

In this paper, we establish a bijection between the infinite reduced words of an affine Weyl group and certain biclosed sets of its positive system and determine all finitely generated biclosed sets in the positive system of an affine Weyl…

Let $G$ be a reductive group with Borel $B$ and Weyl group $W$. Then $B$-double cosets in $G$ are indexed by the Weyl group, say $O(w)$ for $w\in W$. Then we prove the minimal $B$-double coset in the convolution $O(w_1)*O(w_2)$ is…

Involution words are variations of reduced words for twisted involutions in Coxeter groups. They arise naturally in the study of the Bruhat order, of certain Iwahori-Hecke algebra modules, and of orbit closures in flag varieties.…

In a 2015 paper we have defined a map from the set of conjugacy classes in a Weyl group W to the set of irreducible representations of W (its image parametrizes the strata of a reductive group with Weyl group W). In this paper we provide…

Let $W$ be a finite Coxeter group. It is well-known that the number of involutions in $W$ is equal to the sum of the degrees of the irreducible characters of $W$. Following a suggestion of Lusztig, we show that this equality is compatible…

Let G be a semisimple group over an algebraically closed field. Steinberg has associated to a Coxeter element w of minimal length r a subvariety V of G isomorphic to an affine space of dimension r which meets the regular unipotent class Y…

Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…

Consider a weighted Coxeter system $(W,S,\mathscr{L})$. Via its associated Iwahori-Hecke algebra, we may determine the partition of $W$ into Kazhdan-Lusztig cells. In this paper, we use the theory of Vogan classes introduced by…

By Theorem~1.12 of the paper "A Class of Representations of Hecke Algebras", if $W$ is a Coxeter group whose proper parabolic subgroups are finite, and if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a…

Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W. In this paper, we…

We investigate the poset of skew diagrams ordered by adding or forming the union of skew diagrams. We will show that a skew diagram which has at least n convex corners to the upper left and also to the lower right is larger than the skew…

For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…

The stabilization algorithm of Weisfeiler and Leman has as an input any square matrix A of order n and returns the minimal cellular (coherent) algebra W(A) which includes A. In case when A=A(G) is the adjacency matrix of a graph G the…

For a field $F$ of characteristic not 2 and a directed row-finite graph $\Gamma$ let $L(\Gamma)$ be the Leavitt path algebra with the standard involution $*.$ We study the Lie algebra $K=K(L(\Gamma),*)$ of $*-$skew-symmetric elements and…

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…

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy\in E$. For integers $n>k>0 $, the shift graph $G(n,k)$ is the graph whose vertex set…

A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…

Let (W,S) be a Coxeter system of finite rank (ie |S| is finite) and let A be the associated Coxeter (or Davis) complex. We study chains of pairwise parallel walls in A using Tits' bilinear form associated to the standard root system of…

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…