By using Gröbner bases of ideals of polynomial algebras over a field, many implemented algorithms manage to give exciting examples and counter examples in Commutative Algebra and Algebraic Geometry. Part A of this thesis will focus on extending the concept of Gröbner bases and Standard bases for polynomial algebras over the ring of integers and its factors \(\mathbb{Z}_m[x]\). Moreover we implemented two algorithms for this case in Singular which use different approaches in detecting useless computations, the classical Buchberger algorithm and a F5 signature based algorithm. Part B includes two algorithms that compute the graded Hilbert depth of a graded module over a polynomial algebra \(R\) over a field, as well as the depth and the multi...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...
Signature-based algorithms have become a standard approach for Gröbner basis computations for polyno...
AbstractSince Buchberger introduced the theory of Gröbner bases in 1965 it has become an important t...
Signature-based algorithms have brought large improvements in the performances of Gröbner bases alg...
In this dissertation we study several improvements to algorithms used to generate comprehensive Groe...
It is well known that various notions of distinguished bases of ideals, such as standard and Gröbner...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
In the ring of polynomials k[x1,... ,xn] every ideal has a\ud special basis known as a Gröbner basis...
In this thesis we remind you of the basic Buchberger algorithm for com- puting the Gröbner base over...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
In this paper we introduce an algorithm for computing the Stanleydepth of a finitely generated multi...
AbstractThe author defines canonical bases for ideals in polynomial rings over Z and develops an alg...
Gröbner bases have been generalised to polynomials over a commutative ring A in several ways. Here w...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...
Signature-based algorithms have become a standard approach for Gröbner basis computations for polyno...
AbstractSince Buchberger introduced the theory of Gröbner bases in 1965 it has become an important t...
Signature-based algorithms have brought large improvements in the performances of Gröbner bases alg...
In this dissertation we study several improvements to algorithms used to generate comprehensive Groe...
It is well known that various notions of distinguished bases of ideals, such as standard and Gröbner...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
In the ring of polynomials k[x1,... ,xn] every ideal has a\ud special basis known as a Gröbner basis...
In this thesis we remind you of the basic Buchberger algorithm for com- puting the Gröbner base over...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
In this paper we introduce an algorithm for computing the Stanleydepth of a finitely generated multi...
AbstractThe author defines canonical bases for ideals in polynomial rings over Z and develops an alg...
Gröbner bases have been generalised to polynomials over a commutative ring A in several ways. Here w...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
We present an algorithm for determining whether an ideal in a polynomial ring is prime or not. We us...