Related papers: Monomial generators of complete planar ideals
We compute the resultants for quadratic binomial complete intersections. As an application we show that any quadratic binomial complete intersection can have the set of square-free monomials as a vector space basis if the generators are put…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
In this paper we define an interesting family of perfect ideals of codimension three, with five generators, of Cohen-Macaulay type two with trivial multiplication on the Tor algebra. This family is likely to play a key role in classifying…
In this short note we give an elementary description of the linear part of the minimal free resolution of a Stanley-Reisner ring of a simplicial complex $\Delta$. Indeed, the differentials in the linear part are simply a compilation of…
We identify several classes of monomial ideals that possess minimal generalized Barile-Macchia resolutions. These classes of ideals include generic monomial ideals, monomial ideals with linear quotients, and edge ideals of hypertrees. We…
This paper gives a description of various recent results which construct monomial ideals with a given minimal free resolution. We show that these are all instances of coordinatizing a finite atomic lattice as defined by Mapes. Subsequently,…
This paper studies the numbers of minimal generators of powers of monomial ideals in polynomial rings. For a monomial ideal $I$ in two variables, Eliahou, Herzog, and Saem gave a sharp lower bound $\mu (I^2)\ge 9$ for the number of minimal…
This paper presents a powerfull method to integrate general monomials on the classical groups with respect to their invariant (Haar) measure. The method has first been applied to the orthogonal group in [J. Math. Phys. 43, 3342 (2002)], and…
We introduce the concept of quasi-linearity and prove it is necessary for a monomial ideal to have a linear resolution and identify all the quasi-linear quadratic monomial ideals. We define a strongly linear monomial for a monomial ideal…
We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.
The question we address in this paper is: which monomial ideals have minimal cellular resolutions, that is, minimal resolutions obtained from homogenizing the chain maps of CW-complexes? Velasco gave families of examples of monomial ideals…
For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…
An equigenerated monomial ideal $I$ 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 least number of monomial generators of $I$. Freiman ideals are special…
In this paper we extend the well-known iterated mapping cone procedure to monomial ideals in strongly Koszul algebras. We study properties of ideals generated by monomials in commutative Koszul algebras and show that the linear strand of…
We consider the fiber cone of monomial ideals. It is shown that for monomial ideals $I\subset K[x,y]$ of height $2$, generated by $3$ elements, the fiber cone $F(I)$ of $I$ is a hypersurface ring, and that $F(I)$ has positive depth for…
We present a procedure that constructs, in a combinatorial manner, a chain complex of free modules over a polynomial ring in finitely many variables, modulo an ideal generated by quadratic monomials. Applying this procedure to two specific…
Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…
This paper describes a method for computing all F-pure ideals for a given Cartier map of a polynomial ring over a finite field.
Let Q be an affine semigroup generating Z^d, and fix a finitely generated Z^d-graded module M over the semigroup algebra k[Q] for a field k. We provide an algorithm to compute a minimal Z^d-graded injective resolution of M up to any desired…
Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…