中文
相关论文

相关论文: Multiplicity Bounds for Quadratic Monomial Ideals

200 篇论文

Conca and Varbaro (Invent. Math. 221 (2020), no. 3) showed the equality of depth of a graded ideal and its initial ideal in a polynomial ring when the initial ideal is square-free. In this paper, we give some beautiful applications of this…

交换代数 · 数学 2024-09-11 Kamalesh Saha , Indranath Sengupta

In 2003, Fischermann et al. considered the maximum size of \textit{uniquely-dominatable} graphs, graphs whose dominating number is realized only by a unique dominating set. They conjectured a size bound and provide a general graph…

组合数学 · 数学 2025-11-04 Garrison Koch , Darren Narayan

The Multiplicity conjecture of Herzog, Huneke, and Srinivasan states an upper bound for the multiplicity of any graded $k$-algebra as well as a lower bound for Cohen-Macaulay algebras. In this note we extend this conjecture in several…

交换代数 · 数学 2007-05-23 Juan Migliore , Uwe Nagel , Tim Roemer

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…

交换代数 · 数学 2012-12-04 Manoj Kummini

A monomial ideal $I$ is said to have homological linear quotients if for each $k\geq 0$, the homological shift ideal $\mathrm{HS}_k(I)$ has linear quotients. It is a well-known fact that if an edge ideal $I(G)$ has homological linear…

交换代数 · 数学 2025-12-17 Trung Chau , Kanoy Kumar Das , Aryaman Maithani

Herzog, Hibi, and Zheng classified the Cohen-Macaulay edge ideals of chordal graphs. In this paper, we classify Cohen-Macaulay edge ideals of (vertex) weighted oriented chordal and simplicial graphs, a more general class of monomial ideals.…

交换代数 · 数学 2023-08-14 Kamalesh Saha

We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.

交换代数 · 数学 2011-07-08 Viviana Ene , Juergen Herzog , Takayuki Hibi

In the present paper, we aim to classify monomial ideals whose all matching powers are Cohen-Macaulay. We especially focus our attention on edge ideals. The Cohen-Macaulayness of the last matching power of an edge ideal is characterized,…

交换代数 · 数学 2025-04-25 Antonino Ficarra , Somayeh Moradi

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…

组合数学 · 数学 2014-01-22 Dariush Kiani , Sara Saeedi Madani

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we prove that if $G$ is a fan graph of a complete graph, then…

交换代数 · 数学 2019-03-14 A. V. Jayanthan , Arvind Kumar

We establish the multiplicity conjecture of Herzog, Huneke, and Srinivasan about the multiplicity of graded Cohen-Macaulay algebras over a field, for codimension two algebras and for Gorenstein algebras of codimension three. In fact, we…

交换代数 · 数学 2007-05-23 Juan C. Migliore , Uwe Nagel , Tim Römer

In this paper, we first give some sufficient criteria for normality of monomial ideals. As applications, we show that closed neighborhood ideals of complete bipartite graphs are normal, and hence satisfy the (strong) persistence property.…

交换代数 · 数学 2023-08-15 Mehrdad Nasernejad , Somayeh Bandari , Leslie G. Roberts

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

组合数学 · 数学 2026-03-20 Ilya I. Bogdanov , Fedor Petrov , Anton Sadovnichiy , Fedor Ushakov

Let $G$ be a simple finite graph. A famous theorem of Dirac says that $G$ is chordal if and only if $G$ admits a perfect elimination order. It is known by Fr\"oberg that the edge ideal $I(G)$ of $G$ has a linear resolution if and only if…

交换代数 · 数学 2022-12-02 Antonino Ficarra , Jürgen Herzog

Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal…

交换代数 · 数学 2016-05-24 Jennifer Biermann , Augustine O'Keefe , Adam Van Tuyl

Let $G$ be a bipartite graph and $I(G)$ the toric ideal associated to the graph $G$. In this article we calculate Hilbert-Samuel multiplicity of the graph $G$ for which the toric ideal $I(G)$ is generated by a quadratic binomials and it…

交换代数 · 数学 2014-06-25 Priya Das , Himadri Mukherjee

In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…

交换代数 · 数学 2011-10-13 Hailong Dao , Craig Huneke , Jay Schweig

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…

交换代数 · 数学 2020-12-08 Yuriko Pitones , Enrique Reyes , Jonathan Toledo

The Multiplicity Conjecture (MC) of Huneke and Srinivasan provides upper and lower bounds for the multiplicity of a Cohen-Macaulay algebra $A$ in terms of the shifts appearing in the modules of the minimal free resolution (MFR) of $A$. All…

交换代数 · 数学 2007-05-23 Fabrizio Zanello

Let $A = K[X_1,...,X_n]$ and let $I$ be a graded ideal in $A$. We show that the upper bound of Multiplicity conjecture of Herzog, Huneke and Srinivasan holds asymptotically (i.e., for $I^k$ and all $k \gg 0$) if $I$ belongs to any of the…

交换代数 · 数学 2007-10-31 Tony J. Puthenpurakal