A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y]\)

DOI10.1016/S0747-7171(08)80143-5zbMath0805.13008MaRDI QIDQ1186721

H. Penz, Wolfgang N. Herfort

Publication date: 28 June 1992

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

zbMATH Keywords

Buchberger algorithmuniversal Gröbner basisset of term orderings on a polynomial ring

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

A combinatorial result on Gröbner fans with an application to universal Gröbner bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the theory of graded structures
• Stability of Gröbner bases
• The Gröbner fan of an ideal
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Admissible orders and linear forms
• A simplified proof of the characterization theorem for Gröbner-bases
• An extension of buchberger's algorithm to compute all reduced gröbner bases of a polynomial ideal

This page was built for publication: A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y]\)