Related papers: The Graph of Monomial Ideals
In this paper, we study the genera of zero-divisor graphs with respect to ideals in finite rings.
In this paper, we consider homological properties of so-called graph ideals. Consider $\Gamma$ is a graph with vertices $t_1$, ..., $t_s$, without self-loops and multiple adjacencies. We can associate with such a graph an ideal…
In this paper we describe the equations defining the multi-Rees algebra $k[x_1,\dots,x_n][I_1^{a_1}t_1,\dots,I_r^{a_r}t_r]$, where the ideals are generated by subsets of $x_1,\dots,x_n$. We also show that a family of binomials whose leading…
A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…
A tame ideal is an ideal $I$ such that the blowup of the affine space $\mathbb{A}_k^n$ along $I$ is regular. In this paper, we give a combinatorial characterization of tame squarefree monomial ideals. More precisely, we show that a square…
Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove,…
We prove that level binomial edge ideals with regularity 2 and pseudo-Gorenstein binomial edge ideals with regularity 3 are cones, and we describe them completely. Also, we characterize level and pseudo-Gorenstein binomial edge ideals of…
Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…
Let $R$ be a commutative ring with nonzero identity and $I$ a proper ideal of $R$. The {\it ideal-based zero-divisor graph} of $R$ with respect to the ideal $I$, denoted by $\Gamma_I(R)$, is the graph on vertices $\{x \in R\setminus I \mid…
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…
We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the…
We extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a…
In this note we consider monoidal complexes and their associated algebras, called toric face rings. These rings generalize Stanley-Reisner rings and affine monoid algebras. We compute initial ideals of the presentation ideal of a toric face…
We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…
We consider the edge ideals of large classes of graphs with whiskers and for these ideals we prove that the arithmetical rank is equal to the big height. Then we extend these results to other classes of squarefree monomial ideals, generated…
We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…
Let $J\subset S=K[x_0,...,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of the homogeneous polynomial ideals $I$, such that the monomials outside $J$ form a $K$-vector basis of $S/I$, is called a {\em $J$-marked…
We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.