This paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial rings to the case of submodules of free modules over a polynomial ring. The Gröbner fan for a submodule creates a correspondence between a pair consisting of a cone in the fan and a point in the support of the cone and a pair consisting of a leading monomial submodule (or equivalently, a reduced marked Gröbner basis) and a grading of the free module over the ring that is compatible with the choice of leading monomials. The Gröbner walk is an algorithm based on the Gröbner fan that converts a given Gröbner basis to a Gröbner basis with respect to a different monomial order; the point being that the Gröbner walk can be more efficient than the standard a...
AbstractReduction rings are rings in which the Gröbner bases approach is possible, i.e., the Gröbner...
Buchberger (1965) introduced Gröbner bases theory for polynomial rings over fields to give an algor...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...
AbstractThis paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial r...
AbstractThis paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial r...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I of arbitrary di...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I to a Gröbner ba...
By using Gröbner bases of ideals of polynomial algebras over a field, many implemented algorithms ma...
The Gröbner Walk is an algorithm that converts a given Gröbner basis of a polynomial ideal I of arbi...
AbstractIn this paper I present definitions and algorithms for Gröbner bases for submodules of free ...
AbstractSince Buchberger introduced the theory of Gröbner bases in 1965 it has become an important t...
AbstractIn this paper we will define analogs of Gröbner bases forR-subalgebras and their ideals in a...
Gröbner basis is a particular kind of a generating set of an ideal in the polynomial ring S = K[x1, ...
AbstractIn this paper I present definitions and algorithms for Gröbner bases for submodules of free ...
AbstractThe Gröbner walk is an algorithm for conversion between Gröbner bases for different term ord...
AbstractReduction rings are rings in which the Gröbner bases approach is possible, i.e., the Gröbner...
Buchberger (1965) introduced Gröbner bases theory for polynomial rings over fields to give an algor...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...
AbstractThis paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial r...
AbstractThis paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial r...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I of arbitrary di...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I to a Gröbner ba...
By using Gröbner bases of ideals of polynomial algebras over a field, many implemented algorithms ma...
The Gröbner Walk is an algorithm that converts a given Gröbner basis of a polynomial ideal I of arbi...
AbstractIn this paper I present definitions and algorithms for Gröbner bases for submodules of free ...
AbstractSince Buchberger introduced the theory of Gröbner bases in 1965 it has become an important t...
AbstractIn this paper we will define analogs of Gröbner bases forR-subalgebras and their ideals in a...
Gröbner basis is a particular kind of a generating set of an ideal in the polynomial ring S = K[x1, ...
AbstractIn this paper I present definitions and algorithms for Gröbner bases for submodules of free ...
AbstractThe Gröbner walk is an algorithm for conversion between Gröbner bases for different term ord...
AbstractReduction rings are rings in which the Gröbner bases approach is possible, i.e., the Gröbner...
Buchberger (1965) introduced Gröbner bases theory for polynomial rings over fields to give an algor...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...