Displaying similar documents to “An algorithm for primary decomposition in polynomial rings over the integers”

The F4-algorithm for Euclidean rings

Afshan Sadiq (2010)

Open Mathematics

Similarity:

In this short note, we extend Faugére’s F4-algorithm for computing Gröbner bases to polynomial rings with coefficients in an Euclidean ring. Instead of successively reducing single S-polynomials as in Buchberger’s algorithm, the F4-algorithm is based on the simultaneous reduction of several polynomials.

Topics in computational algebraic number theory

Karim Belabas (2004)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We describe practical algorithms from computational algebraic number theory, with applications to class field theory. These include basic arithmetic, approximation and uniformizers, discrete logarithms and computation of class fields. All algorithms have been implemented in the system.

A procedure to compute prime filtration

Asia Rauf (2010)

Open Mathematics

Similarity:

Let K be a field, S = K[x 1, … x n] be a polynomial ring in n variables over K and I ⊂ S be an ideal. We give a procedure to compute a prime filtration of S/I. We proceed as in the classical case by constructing an ascending chain of ideals of S starting from I and ending at S. The procedure of this paper is developed and has been implemented in the computer algebra system Singular.

Approximatting rings of integers in number fields

J. A. Buchmann, H. W. Lenstra (1994)

Journal de théorie des nombres de Bordeaux

Similarity:

In this paper we study the algorithmic problem of finding the ring of integers of a given algebraic number field. In practice, this problem is often considered to be well-solved, but theoretical results indicate that it is intractable for number fields that are defined by equations with very large coefficients. Such fields occur in the number field sieve algorithm for factoring integers. Applying a variant of a standard algorithm for finding rings of integers, one finds a subring of...

Border bases and kernels of homomorphisms and of derivations

Janusz Zieliński (2010)

Open Mathematics

Similarity:

Border bases are an alternative to Gröbner bases. The former have several more desirable properties. In this paper some constructions and operations on border bases are presented. Namely; the case of a restriction of an ideal to a polynomial ring (in a smaller number of variables), the case of the intersection of two ideals, and the case of the kernel of a homomorphism of polynomial rings. These constructions are applied to the ideal of relations and to factorizable derivations. ...

Almost Q -rings

C. Jayaram (2004)

Archivum Mathematicum

Similarity:

In this paper we establish some new characterizations for Q -rings and Noetherian Q -rings.