Related papers: W-graph ideals and biideals

In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…

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…

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. For all $s \geq 1$, we obtain upper bounds for reg$(I(G)^s)$ for bipartite graphs. We then compare the properties of $G$ and $G'$, where $G'$ is the graph…

In this article we introduce and study the intersection graph of graded ideals of graded rings. The intersection graph of $G-$graded ideals of a graded ring $(R,G)$ is a simple graph, denoted by $Gr_G(R)$, whose vertices are the nontrivial…

We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.

We give formulae for the first homology of the $n$-braid group and the pure 2-braid group over a finite graph in terms of graph theoretic invariants. As immediate consequences, a graph is planar if and only if the first homology of the…

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

In this work, some combinatorial lower bound for regularity of powers of the edge ideal of a uniform hypergarph is gained. A family of hypergraphs whose regularity of edge ideal attains this bound and has a significant difference from the…

We classify connected graphs $G$ whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic.

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…

Here we characterize regular and completely regular ordered semigroups by their minimal bi-ideals. A minimal bi-ideal is expressed as a product of a minimal right ideal and a minimal left ideal. Furthermore, we show that every bi-ideal in a…

We initiate the study of C*-algebras and groupoids arising from left regular representations of Garside categories, a notion which originated from the study of Braid groups. Every higher rank graph is a Garside category in a natural way. We…

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

Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

We give a monoidal presentation of Coxeter and braid 2-groups, in terms of decorated planar graphs. This presentation extends the Coxeter presentation. We deduce a simple criterion for a Coxeter group or braid group to act on a category.

We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most…

This article introduces patterns of ideals of numerical semigroups, thereby unifying previous definitions of patterns of numerical semigroups. Several results of general interest are proved. More precisely, this article presents results on…

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…