AbstractIn this paper I present an algorithm for computing the primary decomposition of a submodule of a free module of a polynomial ring in two variables over a field k. Based on Lazard's (1985) algorithm for primary decomposition of ideals in two variables over a field, this algorithm is more explicit than those known for more general cases
AbstractAn algorithm for the prime decomposition of polynomial ideals over small finite fields is pr...
AbstractLet K be an infinite perfect computable field and let I⊆K [ x ] be a zero-dimensional ideal ...
AbstractThis paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial r...
AbstractIn this paper I present an algorithm for computing the primary decomposition of a submodule ...
AbstractIn this paper I present definitions and algorithms for Gröbner bases for submodules of free ...
summary:In this paper we characterize all prime and primary submodules of the free $R$-module $R^{n}...
A complete structure theorem is given for standard (= Gröbner) bases for bivariate polynomials over ...
AbstractIn this paper I present definitions and algorithms for Gröbner bases for submodules of free ...
We present an algorithm to compute the primary decomposition of any ideal in a polynomialring over a...
Primary decomposition of an ideal in a polynomial ring over a field belongs to the indispensable the...
AbstractAlgebraic function fields of positive characteristic are non-perfect fields, and many standa...
We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership ...
We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership ...
AbstractThe first purpose of this paper is to describe a new mathematical approach for the computati...
AbstractThe first purpose of this paper is to describe a new mathematical approach for the computati...
AbstractAn algorithm for the prime decomposition of polynomial ideals over small finite fields is pr...
AbstractLet K be an infinite perfect computable field and let I⊆K [ x ] be a zero-dimensional ideal ...
AbstractThis paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial r...
AbstractIn this paper I present an algorithm for computing the primary decomposition of a submodule ...
AbstractIn this paper I present definitions and algorithms for Gröbner bases for submodules of free ...
summary:In this paper we characterize all prime and primary submodules of the free $R$-module $R^{n}...
A complete structure theorem is given for standard (= Gröbner) bases for bivariate polynomials over ...
AbstractIn this paper I present definitions and algorithms for Gröbner bases for submodules of free ...
We present an algorithm to compute the primary decomposition of any ideal in a polynomialring over a...
Primary decomposition of an ideal in a polynomial ring over a field belongs to the indispensable the...
AbstractAlgebraic function fields of positive characteristic are non-perfect fields, and many standa...
We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership ...
We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership ...
AbstractThe first purpose of this paper is to describe a new mathematical approach for the computati...
AbstractThe first purpose of this paper is to describe a new mathematical approach for the computati...
AbstractAn algorithm for the prime decomposition of polynomial ideals over small finite fields is pr...
AbstractLet K be an infinite perfect computable field and let I⊆K [ x ] be a zero-dimensional ideal ...
AbstractThis paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial r...
DOI
Add to ORKG