Related papers: W-graph ideals

For a Coxeter group $W$ with length function $\ell$, the excess zero graph $\mathcal{E}_0(W)$ has vertex set the non-identity involutions of $W$, with two involutions $x$ and $y$ adjacent whenever $\ell(xy)=\ell(x)+\ell(y)$. Properties of…

In this paper, we will consider the graph w*-probability theory.

Let W be a Weyl group. We define a class of irreducible representations of W that we call antispecial. They are in bijection with the constructible representations of W. We define an oriented graph structure on the set of antispecial…

We consider Kazhdan-Lusztig cells of the symmetric group $S_n$ containing the longest element of a standard parabolic subgroup of $S_n$. Extending some of the ideas in [Beitr{\"a}ge zur Algebra und Geometrie, 59 (2018), no. 3, 523-547] and…

We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…

Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…

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…

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

Let $W$ be a Coxeter group whose proper parabolic subgroups are finite. According to Theorem~1.12 of [1], if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a $W$-graph over $Q$, then $\Gamma$ is acyclic. We…

We study the structure of Wick homogenenous ideals of higher degrees in quadratic algebras allowing Wick ordering. We present a method how to construct a homogeneous Wick ideal $\mathcal{I}_{n+1}$ of degree $n+1$ out of a homogeneous Wick…

The principal left ideal graph of a semigroup is a simple graph whose vertices are the non-zero elements of the semigroup, and two vertices are adjacent if their principal left ideals intersect non-trivially. In this paper, we study the…

This paper gives a definitive solution to the problem of describing conjugacy classes in arbitrary Coxeter groups in terms of cyclic shifts. Let $(W,S)$ be a Coxeter system. A cyclic shift of an element $w\in W$ is a conjugate of $w$ of the…

Let D be a connected graph. The Dynkin complex CD(A) of a D-algebra A was introduced by the second author in [TL2] to control the deformations of quasi-Coxeter algebra structures on A. In the present paper, we study the cohomology of this…

Let (W,S) be a Coxeter system of affine type D, and let TL(W) the corresponding generalized Temperley-Lieb algebra. In this extended abstract we define an infinite dimensional associative algebra made of decorated diagrams which is…

In a recent paper, Barot and Marsh presented an explicit construction of presentation of a finite Weyl group by any seed of corresponding cluster algebra, i.e. by any diagram mutation-equivalent to an orientation of a Dynkin diagram with…

Graph is an usual representation of relational data, which are ubiquitous in manydomains such as molecules, biological and social networks. A popular approach to learningwith graph structured data is to make use of graph kernels, which…

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

We define the s-order principal component of the jets of a graph and give a description of the primary decomposition of its edge ideal in terms of the minimal vertex covers of the base graph. As an application, we show the s-order principal…

In this article, we introduce rotation groups as a common generalisation of Coxeter groups and graph products of groups (including right-angled Artin groups). We characterise algebraically these groups by presentations (periagroups) and we…

Minimal cellular resolutions of the edge ideals of cointerval hypergraphs are constructed. This class of d-uniform hypergraphs coincides with the complements of interval graphs (for the case d=2), and strictly contains the class of…