Related papers: Classifying Nearly Complete Intersection Ideals Ge…

We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr\"obner theory. We give an explicit description of a minimal Gr\"obner bases for each higher syzygy module. In each…

We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under…

A graded ideal $I$ in $\mathbb{K}[x_1,\ldots,x_n]$, where $\mathbb{K}$ is a field, is said to have almost maximal finite index if its minimal free resolution is linear up to the homological degree $\mathrm{pd}(I)-2$, while it is not linear…

We give a positive answer to the Huneke-Wiegand Conjecture for monomial ideals over free numerical semigroup rings, and for two generated monomial ideals over complete intersection numerical semigroup rings.

In this article we investigate when a homogeneous ideal in a graded ring is normal, that is, when all positive powers of the ideal are integrally closed. We are particularly interested in homogeneous ideals in an N-graded ring generated by…

Let $G$ be the circulant graph $C_n(S)$ with $S \subseteq \{1, 2, \dots, \lfloor \frac{n}{2} \rfloor\}$, and let $I(G)$ denote the edge ideal in the polynomial ring $R=\mathbb{K}[x_0, x_1, \dots, x_{n-1}]$ over a field $\mathbb{K}$. In this…

Let $I$ be a monomial ideal in the polynomial ring $S$ generated by elements of degree at most $d$. In this paper, it is shown that, if the $i$-th syzygy of $I$ has no element of degrees $j, \ldots, j+(d-1)$ (where $j \geq i+d$), then…

In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an…

Consider a grade 2 perfect ideal $I$ in $R=k[x_1,\cdots,x_d]$ which is generated by forms of the same degree. Assume that the presentation matrix $\varphi$ is almost linear, that is, all but the last column of $\varphi$ consist of entries…

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…

Let R be a commutative ring with identity. In this paper, we introduce and investigate the second ideal intersection graph SII(R) of R with vertices are non-zero proper ideals of R and two distinct vertices I and J are adjacent if and only…

Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the…

A quasi-complete intersection (q.c.i.) ideal of a local ring is an ideal with "free exterior Koszul homology"; the definition can also be understood in terms of vanishing of Andr\'e-Quillen homology functors. Principal q.c.i. ideals are…

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…

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe…

An equigenerated monomial ideal $I$ in the polynomial ring $R=k[z_1,\ldots, z_n]$ is a Freiman ideal if $\mu(I^2)=\ell(I)\mu(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $\mu(I)$ is the number of minimal…

We are interested in characterizing which classes of finite graphs are well-quasi-ordered by the induced subgraph relation. To that end, we devise an algorithm to decide whether a class of finite graphs well-quasi-ordered by the induced…

We study the finite generation of the intersection algebra of two principal ideals I and J in a unique factorization domain R. We provide an algorithm that produces a list of generators of this algebra over R. In the special case that R is…