English
Related papers

Related papers: Monomial ideals of graphs with loops

200 papers

We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose…

Commutative Algebra · Mathematics 2015-06-04 Dariush Kiani , Sara Saeedi Madani

In this paper we study minimal free resolutions of some classes of monomial ideals. we first give a sufficient condition to check the minimality of the resolution obtained by the mapping cone. Using it, we obtain the Betti numbers of…

Commutative Algebra · Mathematics 2017-08-29 Leila Sharifan

We consider the polynomial ring in finitely many variables over an algebraically closed field of positive characteristic, and initiate the systematic study of ideals preserved by the action of the general linear group by changes of…

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

Commutative Algebra · Mathematics 2025-06-10 Somayeh Moradi , Fahimeh Khosh-Ahang Ghasr

We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are…

Commutative Algebra · Mathematics 2021-12-09 Jürgen Herzog , Masoomeh Rahimbeigi , Tim Römer

Squarefree powers of edge ideals are intimately related to matchings of the underlying graph. In this paper we give bounds for the regularity of squarefree powers of edge ideals, and we consider the question of when such powers are linearly…

Commutative Algebra · Mathematics 2019-09-26 Nursel Erey , Jürgen Herzog , Takayuki Hibi , Sara Saeedi Madani

Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…

Commutative Algebra · Mathematics 2017-02-15 Thomas Kahle , Camilo Sarmiento , Tobias Windisch

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be a monomial ideal generated in degree $d$. Bandari and Herzog conjectured that a monomial ideal $I$ is polymatroidal if and only if all its monomial…

Commutative Algebra · Mathematics 2019-01-23 Amir Mafi , Dler Naderi

Let $G$ be a graph with chordal complement and $I(G)$ its edge ideal. From work of Herzog, Hibi, and Zheng, it is known that $I(G)$ has linear quotients and all of its powers have linear resolutions. For edge ideals $I(G)$ arising from…

Commutative Algebra · Mathematics 2011-06-16 Andrew H. Hoefel , Gwyneth Whieldon

Let $K$ be a field, $V$ a finite dimensional $K$-vector space and $E$ the exterior algebra of $V$. We analyze iterated mapping cone over $E$. If $I$ is a monomial ideal of $E$ with linear quotients, we show that the mapping cone…

Commutative Algebra · Mathematics 2024-05-14 Marilena Crupi , Antonino Ficarra , Ernesto Lax

There is a natural one-to-one correspondence between squarefree monomial ideals and finite simple hypergraphs via the cover ideal construction. Let H be a finite simple hypergraph, and let J = J(H) be its cover ideal in a polynomial ring R.…

Commutative Algebra · Mathematics 2010-11-03 Christopher A. Francisco , Huy Tai Ha , Adam Van Tuyl

In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…

Functional Analysis · Mathematics 2007-05-23 Daniel M. Pellegrino

In this paper we prove the existence of a special order on the set of minimal monomial generators of powers of edge ideals of arbitrary graphs. Using this order we find new upper bounds on the regularity of powers of edge ideals of graphs…

Commutative Algebra · Mathematics 2014-06-03 Arindam Banerjee

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_1, \ldots, x_n\}$ and $I(G) \subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, \ldots, x_n$ over a field $K$ with each ${\rm deg} x_i = 1$ and…

Commutative Algebra · Mathematics 2019-02-28 Takayuki Hibi , Hiroju Kanno , Kazunori Matsuda

Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the…

Commutative Algebra · Mathematics 2011-04-05 Luis A. Dupont , Carlos Renteria-Marquez , Rafael H. Villarreal

The properties of the intersection algebra of two principal monomial ideals in a polynomial ring are investigated in detail. Results are obtained regarding the Hilbert series and the canonical ideal of the intersection algebra using methods…

Commutative Algebra · Mathematics 2014-09-05 Florian Enescu , Sara Malec

In this paper we give a construction for a linear quotient ordering of a class of products of two ideals which have linear quotients. We apply this construction to give a class of modified anticycle graphs whose square and cube have linear…

Commutative Algebra · Mathematics 2026-03-05 Stephen Landsittel

In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…

Combinatorics · Mathematics 2010-08-17 Yi Wang , Bao-Xuan Zhu

Let $S={\sf k}[X_1,\dots, X_n]$ be a polynomial ring, where ${\sf k}$ is a field. This article deals with the defining ideal of the Rees algebra of squarefree monomial ideal generated in degree $n-2$. As a consequence, we prove that Betti…

Commutative Algebra · Mathematics 2021-02-10 Ajay Kumar , Rajiv Kumar

The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…

Combinatorics · Mathematics 2025-12-19 Giulia Codenotti , Roberto Riccardi , Lorenzo Venturello