Displaying similar documents to “On Euclidean Algorithms With Some Particular Properties”

The fourteenth problem of Hilbert for polynomial derivations

Andrzej Nowicki (2002)

Banach Center Publications

Similarity:

We present some facts, observations and remarks concerning the problem of finiteness of the rings of constants for derivations of polynomial rings over a commutative ring k containing the field ℚ of rational numbers.

A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings

Xiangui Zhao, Yang Zhang (2015)

Open Mathematics

Similarity:

Signature-based algorithms are efficient algorithms for computing Gröbner-Shirshov bases in commutative polynomial rings, and some noncommutative rings. In this paper, we first define skew solvable polynomial rings, which are generalizations of solvable polynomial algebras and (skew) PBW extensions. Then we present a signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings over fields.