Displaying similar documents to “An algorithm to calculate the kernel of certain polynomial ring homomorphisms.”

Improvements on the Cantor-Zassenhaus factorization algorithm

Michele Elia, Davide Schipani (2015)

Mathematica Bohemica

Similarity:

The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on the performances, and proposing useful improvements. In particular, a new simplified version of this algorithm is described, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed...

An algorithm to compute the kernel of a derivation up to a certain degree

Stefan Maubach (2001)

Annales Polonici Mathematici

Similarity:

An algorithm is described which computes generators of the kernel of derivations on k[X₁,...,Xₙ] up to a previously given bound. For w-homogeneous derivations it is shown that if the algorithm computes a generating set for the kernel then this set is minimal.

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.

A polynomial reduction algorithm

Henri Cohen, Francisco Diaz Y Diaz (1991)

Journal de théorie des nombres de Bordeaux

Similarity:

The algorithm described in this paper is a practical approach to the problem of giving, for each number field K a polynomial, as canonical as possible, a root of which is a primitive element of the extension K / ℚ . Our algorithm uses the L L L algorithm to find a basis of minimal vectors for the lattice of ℝ n determined by the integers of K under the canonical map.