Related papers: W-graph ideals

In "W-graph ideals" (Robert B. Howlett and Van Minh Nguyen) the concept of a W-graph ideal in a Coxeter group was introduced, and it was shown how a W-graph can be constructed from a given W-graph ideal. In this paper, we describe a class…

This paper is the continuation of the work in~\cite{Yin}. In that paper we generalized the definition of $W$-graph ideal in the weighted Coxeter groups, and showed how to construct a $W$-graph from a given $W$-graph ideal in the case of…

We further develop the theory of $W\!$-graph ideals, first introduced by the authors in reference [6]. We discuss $W\!$-graph subideals, and induction and restriction of $W\!$-graph ideals for parabolic subgroups. We introduce $W\!$-graph…

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…

In this paper, we let $\Hecke$ be the Hecke algebra associated with a finite Coxeter group $W$ and with one-parameter, over the ring of scalars $\Alg=\mathbb{Z}(q, q^{-1})$. With an elementary method, we introduce a cellular basis of…

A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

Let (W, S) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori-Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori-Hecke algebra on the…

Let $(W,S)$ be a finite Coxeter group. Kazhdan and Lusztig introduced the concept of $W$-graphs and Gyoja proved that every irreducible representation of the Iwahori-Hecke algebra $H(W,S)$ can be realized as a $W$-graph. Gyoja defined an…

We introduce and study the concept which we call the splitting of a graph and compare algebraic properties of the edge ideals of graphs and those of their splitting graphs.

A graph $X$ is defined inductively to be $(a_0,\dots,a_{n-1})$-regular if $X$ is $a_0$-regular and for every vertex $v$ of $X$, the sphere of radius $1$ around $v$ is an $(a_1,\dots,a_{n-1})$-regular graph. Such a graph $X$ is said to be…

Let $W$ be a finite Coxeter group and $\Omega$ be its $W$-graph algebra as defined by Gyoja. The author's previous paper \cite{hahn2016wgraphs} considered this algebra in some detail, proposed, and proved in some small cases the $W$-graph…

Let $(W,S)$ be a Coxeter system. A $W$-graph encodes a representation of the Hecke algebra $\mathcal{H}$ of $W$. We construct universal representations of multi-parameter Hecke algebras on certain quotients of path algebras, and study their…

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

In this paper, we will consider the projections in a graph W*-algebra.

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…

We compute Aut(W) for any even Coxeter group whose Coxeter diagram is connected, contains no edges labeled 2, and cannot be separated into more than 2 connected components by removing a single vertex. The description is given explicitly in…

We introduce the concept of distance ideals of graphs, which can be regarded as a generalization of the Smith normal form and the spectra of the distance matrix of a graph. We obtain a classification of the graphs with at most one trivial…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

We associate a sequence of positive integers, termed the type sequence, with a cochordal graph. Using this type sequence, we compute all graded Betti numbers of its edge ideal. We then classify all positive integer $n$ such that the zero…