Lifting canonical algorithms from a ring R to the ring R[x]

DOI10.1016/S0747-7171(88)80041-5zbMath0673.68026MaRDI QIDQ1121016

R. Shtokhamer

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Gröbner basiscanonical simplificationdetachable idealsSzekeres bases

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Related Items (10)

An extension of the Prelle-Singer method and a Maple implementation ⋮ Computing a Gröbner basis of a polynomial ideal over a Euclidean domain ⋮ A semi-algorithm to find elementary first order invariants of rational second order ordinary differential equations ⋮ Lifting canonical algorithms from a ring R to the ring R[x] ⋮ Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem ⋮ Some results on Gröbner bases over commutative rings ⋮ Integrating first-order differential equations with Liouvillian solutions via quadratures: a semi-algorithmic method ⋮ Determining Liouvillian first integrals for dynamical systems in the plane ⋮ [QPSI. A MAPLE package for the determination of quasi-polynomial symmetries and invariants] ⋮ Finding elementary first integrals for rational second order ordinary differential equations

Cites Work

• On constructing bases for ideals in polynomial rings over the integers
• Lifting canonical algorithms from a ring R to the ring R[x]
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Constructive Aspects of Noetherian Rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lifting canonical algorithms from a ring R to the ring R[x]