Related papers: Cohen-Macaulay binomial edge ideals of small devia…
In this article, we explore the class of graphs for which the projective dimension of the quotient of the binomial edge ideals matches the big height of that ideal. Additionally, we investigate the Vasconcelos number of binomial edge ideals…
We classify the ideals of mixed products that are sequentially Cohen-Macaulay.
Recently, nearly complete intersection ideals were defined by Boocher and Seiner to establish lower bounds on Betti numbers for monomial ideals (arXiv:1706.09866). Stone and Miller then characterized nearly complete intersections using the…
It is shown that in a Cohen-Macaulay local ring, the generic linkage of an ideal $I$ is a deformation of the arbitrary linkage of $I$. This fact does not need $I$ to be a Cohen-Macaulay ideal. The same holds for $s$-residual intersections…
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
Monomial ideals corresponding to strong quasi-n-partite graphs are considered. Some algebraic and combinatorial properties of generalized graph ideals of a strong quasi-n-partite graph are studied. Furthermore, we show that the edge ideal…
For a graph $G$, Bolognini et al. have shown $J_{G}$ is strongly unmixed $\Rightarrow$ $J_{G}$ is Cohen-Macaulay $\Rightarrow$ $G$ is accessible, where $J_{G}$ denotes the binomial edge ideals of $G$. Accessible and strongly unmixed…
We compute the reverse lexicographic generic initial ideals of the powers of a 2-complete intersection ideal I. In particular, we give six algorithms to compute these generic initial ideals, the choice of which depends on the power and on…
In this article, we survey the recent results on the Castelnuovo-Mumford regularity of binomial edge ideals and generalized binomial edge ideals. We also generalize some of the known upper bounds for binomial edge ideals to the case of…
We show that any lexsegment ideal with linear resolution has linear quotients with respect to a suitable ordering of its minimal monomial generators. For completely lexsegment ideals with linear resolution we show that the decomposition…
We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…
We consider homogeneous binomial ideals $I=(f_1,\ldots,f_n)$ in $K[x_1, \ldots, x_n]$, where $f_i = a_i x_i^{d_i} - b_i m_i$ and $a_i \neq 0$. When such an ideal is a complete intersection, we show that the monomials which are not divisible…
We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's…
Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in the polynomial ring $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the Hilbert series of binomial edge…
We describe the simplicial complex $\Delta$ such that the initial ideal of $J_G$ is the Stanley-Reisner ideal of $\Delta$. By $\Delta$ we show that if $J_G$ is $(S_2)$ then $G$ is accessible. We also characterize all accessible blocks with…
The second Veronese ideal $I_n$ contains a natural complete intersection $J_n$ generated by the principal $2$-minors of a symmetric $(n\times n)$-matrix. We determine subintersections of the primary decomposition of $J_n$ where one…
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,…
We study initial algebras of determinantal rings, defined by minors of generic matrices, with respect to their classical generic point. This approach leads to very short proofs for the structural properties of determinantal rings. Moreover,…
We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved.…
The principal result is a primary decomposition of ideals generated by the (2x2)-subpermanents of a generic matrix. These permanental ideals almost always have embedded components and their minimal primes are of three distinct heights. Thus…