Related papers: Complete intersections in binomial and lattice ide…
This paper is a continuation of a previous work by the author and G. Puninski where iterated intersections of powers of ideals were studied in rings of iterated differential polynomials. We present a method which can be used to show that…
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…
We study the linkage classes of homogeneous ideals in polynomial rings. An ideal is said to be homogeneously licci if it can be linked to a complete intersection using only homogeneous regular sequences at each step. We ask a natural…
We introduce a class of Stanley-Reisner ideals called generalized complete intersection, which is characterized by the property that all the residue class rings of powers of the ideal have FLC. We also give a combinatorial characterization…
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…
The binomial ideal associated with the intersection axiom of conditional probability is shown to be radical and is expressed as intersection of toric prime ideals. This resolves a conjecture in algebraic statistics due to Cartwright and…
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…
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…
Developing a previous idea of Faltings, we characterize the complete intersections of codimension 2 in P^n, n>=3, over an algebraically closed field of any characteristic, among l.c.i. X, as those that are subcanonical and…
We give criteria for graded ideals to have the property that all their powers are componentwise linear. Typical examples to which our criteria can be applied include the vertex cover ideals of certain finite graphs.
Given a set $\mathcal A = \{a_1,\ldots,a_n\} \subset \mathbb{N}^m$ of nonzero vectors defining a simplicial toric ideal $I_{\mathcal A} \subset k[x_1,...,x_n]$, where $k$ is an arbitrary field, we provide an algorithm for checking whether…
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.
We prove that every quasi-complete intersection ideal is obtained from a pair of nested complete intersection ideals by way of a flat base change. As a by-product we establish a rigidity statement for the minimal two-step Tate complex…
A commutative local ring is generally defined to be a complete intersection if its completion is isomorphic to the quotient of a regular local ring by an ideal generated by a regular sequence. It has not previously been determined whether…
We extend the notions of complete intersection dimension and lower complete intersection dimension to the category of complexes with finite homology and verify basic properties analogous to those holding for modules. We also discuss the…
Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…
Ideals are one of the main topics of interest to the study of the order structure of an algebra. Due to their nice properties, ideals have an important role both in lattice theory and semigroup theory. Two natural concepts of ideal can be…
From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath theorem from Database Dependency theory. Next, we leverage…
An almost complete intersection ideal can be seen as a $d$-sequence ideal with the minimal number of generators being one more than its height. In this paper, we give exact formulas for the regularity of powers of graded almost complete…
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.