Let R be monomial sub-algebra of $k[x_1,...,x_N]$ generated by square free monomials of degree two. This paper addresses the following question: when is R a complete intersection?
For such a k-algebra we can associate a graph G whose vertices are $x_1,...,x_N$ and whose edges are $\{(x_i, x_j) | x_i x_j \in R \}$. Conversely, for any graph G with vertices $\{x_1,...,x_N\}$ we define the {\it edge algebra associated with G} as the sub-algebra of $k[x_1,...,x_N]$ generated by the monomials ${x_i x_j | (x_i,x_j) \text{is an edge of} G}$. We denote this monomial algebra by k[G].
This paper describes all bipartite graphs whose edge algebras are complete intersections.
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideals are minimally generated by Groebner bases. We prove that any graph can be oriented such that its toric ideal is a complete intersection with a universal Groebner basis determined by the cycles. It turn…
We give the Castelnuovo-Mumford regularity of arrangements of (n-2)-planes in P^n whose incidence graph is a sufficiently large complete bipartite graph, and determine when such arrangements are arithmetically Cohen-Macaulay.
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 two. We prove that toric ideals of graphs which are complete intersections are circuit ideals. The generators of the toric ideal correspond to even cycles of $G$ except of at most one generator, which corresponds to two edge disjoint odd cycles joint at a vertex or with a path. We prove that the blocks of the graph satisfy the odd cycle condition. Finally we …
Waring rank of certain complete intersection forms
Nanyang Technological University（南洋理工大学）；Politecnico Di Torino（都灵理工大学）；Indian Institute of Technology Dharwad（达尔瓦德印度理工学院）；Indian Institute of Technology Bombay（孟买印度理工学院）
We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a generator of A(I) in the case that I is a modification of the vertex cover ideal of a bipartite graph, and show that this highest degree can be any given number. We furthermore give an upper bound for the highest degree of a generator of the integral closure of A(I) in the case that I is a monomial ideal which is generically a complete intersection.
Call a domain $R$ an sQQR-domain if each simple overring of $R$, i.e., each ring of the form $R[u]$ with $u$ in the quotient field of $R$, is an intersection of localizations of $R$. We characterize Prüfer domains as integrally closed sQQR-domains. In the presence of certain finiteness conditions, we show that the sQQR-property is very strong; for instance, a Mori sQQR-domain must be a Dedekind domain. We also show how to construct sQQR-domains which have (non-simple) overrings which are not intersections of localizations.
Previously, Ohsugi and Hibi gave a combinatorial description of bipartite graphs $G$ whose toric edge ideal $I_G$ is generated by quadrics, showing that every cycle of $G$ of length at least $6$ must have a chord. This corresponds to the Green-Lazarsfeld condition $\mathbf{N}_1$. In this paper, we investigate the higher syzygies of $I_G$ and give combinatorial descriptions of the Green-Lazarsfeld conditions $\mathbf{N}_p$ of toric edge ideals of bipartite graphs for all $p \ge 1$. In particular, we show that $I_G$ is linearly presented (i.e. satisfies condition $\mathbf{N}_2$) if and only if t…
An equigenerated monomial ideal $I$ in the polynomial ring $R=k[z_1,\ldots, z_n]$ is a Freiman ideal if $μ(I^2)=\ell(I)μ(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $μ(I)$ is the number of minimal generators of $I$. In this paper we classify all simple connected unmixed bipartite graphs whose cover ideals are Freiman ideals.
Let G be a bipartite graph with edge ideal I(G) whose quotient ring R/I(G) is sequentially Cohen-Macaulay. We prove: (1) the independence complex of G must be vertex decomposable, and (2) the Castelnuovo-Mumford regularity of R/I(G) can be determined from the invariants of G.
Commutative rings in which every prime ideal is the intersection of maximal ideals are called Hilbert (or Jacobson) rings. We propose to define classical Hilbert modules by the property that {\it classical prime} submodules are the intersection of maximal submodules. It is shown that all co-semisimple modules as well as all Artinian modules are classical Hilbert modules. Also, every module over a zero-dimensional ring is classical Hilbert. Results illustrating connections amongst the notions of classical Hilbert module and Hilbert ring are also provided. Rings $R$ over which all $R$-modules ar…
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 invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.
We show that the Stanley-Reisner ideal of the one-dimensional simplicial complex whose diagram is an $n$-gon is always a set-theoretic complete intersection in any positive characteristic.
We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the converse of a well-known result due to Hartshorne, showing that the Cohen-Macaulayness of these ideals is equivalent to the connectedness of their dual graphs. We study interesting properties also for non-bipartite graphs and in the unmixed case, constructing classes of bipartite graphs with $J_G$ unmixed and not Cohen-Macaulay.
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks whether its toric ideal $P_G$ is a complete intersection or not. Whenever $P_G$ is a complete intersection, the algorithm also returns a minimal set of generators of $P_G$. Moreover, we prove that if $G$ is a connected graph and $P_G$ is a complete intersection, then there exist two induced subgraphs $R$ and $C$ of $G$ such that the vertex set $V(G)$ of $G$ is…
We determine the simplicial compleses $Δ$ whose Stanley-Reisner ideals $I_Δ$ have the following property: for all $n\geq 1$ the powers $I_Δ^n$ have linear resolutions and finite length local cohomologies.
In this paper, we prove that the Stanley--Reisner ideal of any connected simplicial complex of dimension $\ge 2$ that is locally complete intersection is a complete intersection ideal. As an application, we show that the Stanley--Reisner ideal whose powers are Buchsbaum is a complete intersection ideal.
Associated to a simple undirected graph $G$ is a simplicial complex $Δ_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $Δ_G$ is a vertex decomposable simplicial complex. We are interested in determining what families of graph have the property that the complement of $G$, denoted by $\overline{G}$, is vertex decomposable. We obtain the result that the complement of a connected bipartite graph is vertex decomposable and so it is Cohen-Macaulay due to pureness of $Δ_{\overline{G}}$.
In this paper we discuss the problem of characterizing the Cohen-Macaulay property of certain families of monomial ideals with fixed radical. More precisely, we consider generically complete intersection monomial ideals whose radical corresponds to special classes of simplicial complexes.
In this paper, we study the Hankel edge ideals of graphs. We determine the minimal prime ideals of the Hankel edge ideal of labeled Hamiltonian and semi-Hamiltonian graphs, and we investigate radicality, being a complete intersection, almost complete intersection and set theoretic complete intersection for such graphs. We also consider the Hankel edge ideal of trees with a natural labeling, called rooted labeling. We characterize such trees whose Hankel edge ideal is a complete intersection, and moreover, we determine those whose initial ideal with respect to the reverse lexicographic order sa…
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 $H_P$ possesses a quadratic Gröbner basis. Thus in particular all powers of $H_P$ have linear resolutions. Second, the minimal free graded resolution of $H_P$ will be constructed explicitly and a combinatorial formula to compute the Betti numbers of $H_P$ will be presented. Third, by using the fact that the Alexander dual of the simplicial complex $Δ$ whose Stan…
We focus in this paper on edge ideals associated to bipartite graphs and give a combinatorial characterization of those having regularity 3. When the regularity is strictly bigger than 3, we determine the first step $i$ in the minimal graded free resolution where there exists a minimal generator of degree $>i+3$, show that at this step the highest degree of a minimal generator is $i+4$, and determine the value of the corresponding graded Betti number $β_{i,i+4}$ in terms of the combinatorics of the associated bipartite graph. The results can then be easily extended to the non-squarefree case t…
In this paper, we determine bipartite graphs and complete graphs with horns, which are realizable as zero-divisor graphs of po-semirings. As applications, we classify commutative rings $R$ whose annihilating-ideal graph $\mathbb {AG}(R)$ are either bipartite graphs or complete graphs with horns.
