Related papers: W-graph ideals
We study divergence and thickness for general Coxeter groups $W$. We first characterise linear divergence, and show that if $W$ has superlinear divergence then its divergence is at least quadratic. We then formulate a computable…
Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…
Super Weyl group plays an important role in the study of representations of basic classical Lie superalgebras. The Coxeter graphs for super Weyl groups of basis classical Lie superalgebras have been given in \cite{CLS}, where the authors…
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…
A gain graph over a group $G$, also referred to as $G$-gain graph, is a graph where an element of a group $G$, called gain, is assigned to each oriented edge, in such a way that the inverse element is associated with the opposite…
The goal of this paper is to describe a sufficient condition on cycles in graphs for which the edge ideal is splittable. We give an explicit splitting function for such ideals.
Ideals are one of the main topics of interest to the study of the order structure of an algebra. Due to their nice properties, ideals have an important role both in lattice theory and semigroup theory. Two natural concepts of ideal can be…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop a theory of the fundamental groupoid of a k-graph, and relate it…
Specht ideals are symmetric ideals in the polynomial ring generated by Specht polynomials associated with group representations. These ideals were previously studied for reflection groups of types $A$ and $B$, where their inclusion…
We classify the gauge-invariant ideals in the C*-algebras of infinite directed graphs, and describe the quotients as graph algebras. We then use these results to identify the gauge-invariant primitive ideals in terms of the structural…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…
In this paper, we study the genera of zero-divisor graphs with respect to ideals in finite rings.
Let $(W,S)$ be a Coxeter system and $\Gamma$ be a group of automorphisms of $W$ such that $\gamma(S)=S$ for all $\gamma \in \Gamma$. Then it is known that the group of fixed points $W^\Gamma$ is again a Coxeter group with a canonically…
We introduce the notion of weighted Coxeter graph and associate to it a certain generalization of the standard geometric representation of a Coxeter group. We prove sufficient conditions for faithfulness and non-faithfulness of such a…
In 2011, Howlett and Nguyen \cite{r1} introduced the concept of a $W$-graph ideal $E_J$ in $\left ( W,\leqslant_{L} \right )$ with respect to $J$ (a subset of $S$), where $\leqslant _{L}$ is the left weak order on $W$. They proved that one…
In this article, we introduce and investigate a class of C$^{\ast}$-algebras generated by reduced graph products of C$^{\ast}$-algebras, augmented with families of projections naturally associated with words in right-angled Coxeter groups.…
Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we investigate the Betti numbers of $I(\mathcal{D})$ via upper-Koszul simplicial complexes, Betti splittings and the mapping cone…
Let $(W,S,L)$ be a weighted Coxeter system and $J$ a subset of $S$, Yin [12] introduced the weighted $W$-graph ideal $E_J$ and the weighted Kazhdan-Lusztig polynomials $ \left \{ P_{x,y} \mid x,y\in E_J\right \}$. In this paper, we study…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
Let $W$ be a Coxeter group and $r\in W$ a reflection. If the group of order 2 generated by $r$ is the intersection of all the maximal finite subgroups of $W$ that contain it, then any isomorphism from $W$ to a Coxeter group $W'$ must take…