Add to ORKGAbstract. Let k[x1,..., xn] be a polynomial ring in n variables, and let I ⊂ k[x1,..., xn] be a homogeneous binomial ideal. We describe a fast algorithm to compute the saturation, I: (x1 · · ·xn)∞. In the special case when I is a toric ideal, we present some preliminary results comparing our algorithm with Project and Lift by Hemmecke and Malkin
We develop tools to study the problem of containment of symbolic powers I^(m) in powers I^r for a ho...
Powers of (monomial) ideals is a subject that still calls attraction in various ways. In this paper ...
AbstractIn this paper, we present an optimal, exponential space algorithm for generating the reduced...
Abstract. Let k[x1,..., xn] be a polynomial ring in n variables, and let I ⊂ k[x1,..., xn] be a homo...
Let I be an ideal in the polynomial ring k[x] over a field k. Saturation of I by the product x1 · ·...
AbstractLet I be a homogeneous ideal of the polynomial ring K[x0,…,xn], where K is an arbitrary fiel...
Let I be a height two perfect ideal in the polynomial ring k[x1,…,x d] satisfying the Gd condition. ...
AbstractFor several computational procedures such as finding radicals and Noether normalizations, it...
In this paper we review the known algorithms for performing the basic algorithms for ideal and submo...
This thesis gives background information on algebra and Gröbner bases to solve the following problem...
Let $S=\mathbb{K}[x_1,\ldots, x_n]$ be the polynomial ring over a field $\mathbb{K}$ and $\mathfrak{...
AbstractIt is known that the reduced Gröbner basis of general polynomial ideals can be computed in e...
Toric ideals are binomial ideals which represent the algebraic relations of sets of power products. ...
We consider an homogeneous ideal $I$ in the polynomial ring $S=K[x_1,\dots,$ $x_m]$ over a finite fi...
This paper is concerned with linear algebra based methods for solving exactly polynomial systems thr...
We develop tools to study the problem of containment of symbolic powers I^(m) in powers I^r for a ho...
Powers of (monomial) ideals is a subject that still calls attraction in various ways. In this paper ...
AbstractIn this paper, we present an optimal, exponential space algorithm for generating the reduced...
Abstract. Let k[x1,..., xn] be a polynomial ring in n variables, and let I ⊂ k[x1,..., xn] be a homo...
Let I be an ideal in the polynomial ring k[x] over a field k. Saturation of I by the product x1 · ·...
AbstractLet I be a homogeneous ideal of the polynomial ring K[x0,…,xn], where K is an arbitrary fiel...
Let I be a height two perfect ideal in the polynomial ring k[x1,…,x d] satisfying the Gd condition. ...
AbstractFor several computational procedures such as finding radicals and Noether normalizations, it...
In this paper we review the known algorithms for performing the basic algorithms for ideal and submo...
This thesis gives background information on algebra and Gröbner bases to solve the following problem...
Let $S=\mathbb{K}[x_1,\ldots, x_n]$ be the polynomial ring over a field $\mathbb{K}$ and $\mathfrak{...
AbstractIt is known that the reduced Gröbner basis of general polynomial ideals can be computed in e...
Toric ideals are binomial ideals which represent the algebraic relations of sets of power products. ...
We consider an homogeneous ideal $I$ in the polynomial ring $S=K[x_1,\dots,$ $x_m]$ over a finite fi...
This paper is concerned with linear algebra based methods for solving exactly polynomial systems thr...
We develop tools to study the problem of containment of symbolic powers I^(m) in powers I^r for a ho...
Powers of (monomial) ideals is a subject that still calls attraction in various ways. In this paper ...
AbstractIn this paper, we present an optimal, exponential space algorithm for generating the reduced...