相关论文: Inverse Grobner Basis Problem in Codimension Two

Gr\"obner bases are a fundamental tool when studying ideals in multivariate polynomial rings. More recently there has been a growing interest in transferring techniques from the field case to other coefficient rings, most notably Euclidean…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

In this paper, new algebraic and topological results on purely-prime ideals of a commutative ring (pure spectrum) are obtained. Especially, Grothendieck type theorem is obtained which states that there is a canonical correspondence between…

We determine criteria for the prime spectrum of an ambiskew polynomial algebra $R$ over an algebraically closed field $K$ to be akin to those of two of the principal examples of such an algebra, namely the universal enveloping algebra…

We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…

We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…

Our focus in this paper is in effective computation of the core core(I) of an ideal I which is defined to be the intersection of all minimal reductions of I. The first main result is a closed formula for the graded core(m) of the maximal…

An essential generalization of the Lebedev index transform with the square of the Macdonald function is investigated. Namely, we consider a family of integral operators with the positive kernel $|K_{(i\tau+\alpha)/2}(x)|^2, \alpha \ge 0,\ x…

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

We show that, under certain constraints, the Stanley-Reisner ring of an infinite simplicial complex is Cohen-Macaulay in the sense of ideals and weak Bourbaki unmixed. We apply this result to prove the wanted claim -- that initial complexes…

Hara, Takemura and Yoshida discuss toric ideals arising from two way subtable sum problems and shows that these toric ideals are generated by quadratic binomials if and only if the subtables are either diagonal or triangular. In the present…

We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the rank decoding problem, which is used in the construction of public-key cryptography.…

To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…

By generalizing the notion of the path ideal of a graph, we study some algebraic properties of some path ideals associated to a line graph. We show that the quotient ring of these ideals are always sequentially Cohen-Macaulay and also…

Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.

Given a homogeneous ideal I of a polynomial ring A=K[X_1,...,X_n] and a monomial order, we construct a new monomial ideal of A associated with I. We call it the zero-generic initial ideal of I with respect to the order and denote it with…

There has arisen in recent years a substantial theory of "multiplier ideals'' in commutative rings. These are integrally closed ideals with properties that lend themselves to highly interesting applications. But how special are they among…

In this paper we give an upper bound, in characteristic 0, for the cohomological dimension of a graded ideal in a polynomial ring such that the quotient has depth at least 3. In positive characteristic the same bound holds true by a…