Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
From MaRDI portal
Publication:1256518
DOI10.1016/0022-314X(78)90019-7zbMath0404.13004MaRDI QIDQ1256518
Publication date: 1978
Published in: Journal of Number Theory (Search for Journal in Brave)
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Equations in general fields (12E12) Polynomials over commutative rings (13B25) Structure, classification theorems for modules and ideals in commutative rings (13C05)
Related Items (39)
Some examples for solving systems of algebraic equations by calculating Gröbner bases ⋮ New constructive methods in classical ideal theory ⋮ An introduction to commutative and noncommutative Gröbner bases ⋮ Applications of Gröbner bases to signal and image processing: a survey ⋮ Generalized Gröbner bases: Theory and applications. A condensation ⋮ A theorem on refining division orders by the reverse lexicographic order ⋮ History and basic features of the critical-pair/completion procedure ⋮ A generalization of reduction rings ⋮ Computing a Gröbner basis of a polynomial ideal over a Euclidean domain ⋮ On ideal lattices, Gröbner bases and generalized hash functions ⋮ Stability of Gröbner bases ⋮ Gröbner bases and primary decomposition of polynomial ideals ⋮ On the D-bases of polynomial ideals over principal ideal domains ⋮ On generating sets and gröbner bases for polynomial ideals ⋮ A refutational approach to geometry theorem proving ⋮ On radical zero-dimensional ideals ⋮ On the construction of Gröbner bases using syzygies ⋮ On the computation of generalized standard bases ⋮ Efficient Gröbner bases computation over principal ideal rings ⋮ Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings ⋮ A new method for solving algebraic systems of positive dimension ⋮ Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm ⋮ TEST OF EPIMORPHISM FOR FINITELY GENERATED MORPHISMS BETWEEN AFFINE ALGEBRAS OVER COMPUTATIONAL RINGS ⋮ Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem ⋮ Gröbner bases with coefficients in rings ⋮ Solutions of systems of algebraic equations and linear maps on residue class rings ⋮ Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I ⋮ On lucky ideals for Gröbner basis computations ⋮ Dynamical Gröbner bases over Dedekind rings ⋮ Degree reduction under specialization ⋮ A criterion for detecting m-regularity ⋮ On the Jacobian conjecture: A new approach via Gröbner bases ⋮ Thirty years of polynomial system solving, and now? ⋮ Konstruktion von Zahlkörpern mit der Galoisgruppe \(M_{11}\) über \(\mathbb{Q}(\sqrt{-11})\) ⋮ A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type ⋮ Computational ideal theory in finitely generated extension rings ⋮ On constructing bases for ideals in polynomial rings over the integers ⋮ On decomposing systems of polynomial equations with finitely many solutions ⋮ The reduction ring property is hereditary
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Konstruktion von Zahl- und Funktionenkörpern mit vorgegebener Galoisgruppe.
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Constructions in Algebra
- Constructive Aspects of Noetherian Rings
This page was built for publication: Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
