Related papers: Monomial ideals, edge ideals of hypergraphs, and t…
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employing basic methods from topological combinatorics, we obtain…
If $M$ is the complement of a hyperplane arrangement, and $A=H^*(M,\k)$ is the cohomology ring of $M$ over a field of characteristic 0, then the ranks, $\phi_k$, of the lower central series quotients of $\pi_1(M)$ can be computed from the…
In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by S. Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the…
In this article, we investigate the combinatorial and algebraic properties of the lcm-lattice associated with the edge ideal of a hypergraph. Let $\H$ be a hypergraph, $I(\H)$ its corresponding edge ideal in a polynomial ring in $n$…
A certain squarefree monomial ideal $H_P$ arising from a finite partially ordered set $P$ will be studied from viewpoints of both commutative algebra and combinatorics. First, it is proved that the defining ideal of the Rees algebra of…
We will explore some properties of minimal graded free resolutions of $R/I$, where $R$ is a trivariate polynomial ring over a field and $I$ is a monomial ideal. Our focus will be to consider a specific form of the resolutions when $I$ is…
We study the regularity and the projective dimension of the Stanley-Reisner ring of a $k$-decomposable simplicial complex and explain these invariants with a recursive formula. To this aim, the graded Betti numbers of $k$-decomposable…
Given a hypergraph $\mathcal{H}$, we introduce a new class of evaluation toric codes called edge codes derived from $\mathcal{H}$. We analyze these codes, focusing on determining their basic parameters. We provide estimations for the…
Every multigraded free resolution of a monomial ideal I contains the Scarf multidegrees of I. We say I has a Scarf resolution if the Scarf multidegrees are sufficient to describe a minimal free resolution of I. The main question of this…
We prove a sufficient and a necessary condition for a square-free monomial ideal $J$ associated to a (dual) hypergraph to have projective dimension equal to the minimal number of generators of $J$ minus 2. We also provide an effective…
We study algebraic and homological properties of the ideal of submaximal minors of a sparse generic symmetric matrix. This ideal is generated by all $(n-1)$-minors of a symmetric $n \times n$ matrix whose entries in the upper triangle are…
In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally torsion-free cover ideals. Next, we characterize all…
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.…
We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in…
We show how to lift any monomial ideal J in n variables to a saturated ideal I of the same codimension in n+t variables. We show that I has the same graded Betti numbers as J and we show how to obtain the matrices for the resolution of I.…
In the origins of complexity theory Booth and Lueker showed that the question of whether two graphs are isomorphic or not can be reduced to the special case of chordal graphs. To prove that, they defined a transformation from graphs G to…
Let $G$ be a finite simple graph and let $I(G)$ be its edge ideal. In this article, we deeply investigate the squarefree powers of $I(G)$ by means of Betti splittings. When $G$ is a forest, it is shown that the normalized depth function of…
We study various ideals arising in the theory of system reliability. We use ideas from the theory of divisors, orientations and matroids on graphs to describe the minimal polyhedral cellular free resolutions of these ideals. In each case we…
We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo-Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by $m(G)+1$, where…
Connectivity is a central notion of graph theory and plays an important role in graph algorithm design and applications. With emerging new applications in networks, a new type of graph connectivity problem has been getting more…