相关论文: On ideals generated by monomials and one binomial
We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…
Let $S={\Bbb K}[x_1,\dots,x_n]$ denote a polynomial ring over a field $\Bbb K$. Given a monomial ideal $I$ and a finitely generated multigraded $M$ over $S$, we follow Herzog's method to construct a multigraded free $S$-resolution of $M/IM$…
A minor is principal means it is defined by the same row and column indices. Let $X$ be a square generic matrix, $K[X]$ the polynomial ring in entries of $X$, over an algebraically closed field, $K$. For fixed $t\leq n$, let $\mathfrak P_t$…
There is a longstanding conjecture by Fr\"oberg about the Hilbert series of the ring $R/I$, where $R$ is a polynomial ring, and $I$ an ideal generated by generic forms. We prove this conjecture true in the case when $I$ is generated by a…
We estimate the Castelnuovo-Mumford regularity of ideals in a polynomial ring over a field by studying the regularity of certain modules generated in degree zero and with linear relations. In dimension one, this process gives a new type of…
We give a numerical characterization of the possible extremal Betti numbers (values as well as positions) of any homogeneous ideal in a polynomial ring over a field.
In this paper we study prime and maximal ideals in a Hurwitz polynomial ring hR. It is well-known that to study many questions we may assume R is prime and consider just R-disjoint ideals. We give a characterization for an R-disjoint ideal…
With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…
In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra $K[x_1,\ldots,x_d]$ over a field $K$ that are not in the ideal itself and Macaulay's inverse systems of such polynomial algebras in a…
We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…
This paper is devoted to give all the technical constructions and definitions that will lead to the construction of an algorithm of resolution of singularities for binomial ideals. We construct a resolution function that will provide a…
Neural ideals, originally defined in arXiv:1212.4201, give a way of translating information about the firing pattern of a set of neurons into a pseudomonomial ideal in a polynomial ring. We give a simple criterion for determining whether a…
An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…
We study the distribution of principal ideals generated by irreducible elements in an algebraic number field.
A Gotzmann monomial ideal of the polynomial ring is a monomial ideal which is generated in one degree and which satisfies Gotzmann's persistence theorem. A subset $V$ is said to be a Gotzmann subset if the ideal generated by $V$ is a…
The properties of the intersection algebra of two principal monomial ideals in a polynomial ring are investigated in detail. Results are obtained regarding the Hilbert series and the canonical ideal of the intersection algebra using methods…
Let $f(Z)=Z^n-a_{1}Z^{n-1}+\cdots+(-1)^{n-1}a_{n-1}Z+(-1)^na_n$ be a monic polynomial with coefficients in a ring~$R$ with identity, not necessarily commutative. We study the ideal $I_f$ of $R[X_1,\dots,X_n]$ generated by…
It is known that a linear code can be represented by a binomial ideal. In this paper, we give standard bases for the ideals in a localization of the multivariate polynomial ring in the case of linear codes over prime fields.
We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…
We present some examples of squarefree monomial ideals whose arithmetical rank can be computed using linear algebraic considerations.