Computing final polynomials and final syzygies using Buchberger's Gröbner bases method
From MaRDI portal
Publication:2639107
DOI10.1007/BF03322623zbMath0718.13009MaRDI QIDQ2639107
Publication date: 1989
Published in: Results in Mathematics (Search for Journal in Brave)
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) Polynomials over commutative rings (13B25) Syzygies, resolutions, complexes and commutative rings (13D02) Relevant commutative algebra (14A05) Computational aspects in algebraic geometry (14Q99)
Related Items
Enumerating Motzkin–Rabin geometries, Mechanical theorem proving in projective geometry, Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. I: Incidence geometry., Computing combinatorial decompositions of rings, On the finding of final polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases and invariant theory
- Using Gröbner bases to reason about geometry problems
- Altshuler's sphere \(M^{10}_{425}\) is not polytopal
- Polytopal and nonpolytopal spheres. An algorithmic approach
- Bounds for the degrees in the Nullstellensatz
- Basic principles of mechanical theorem proving in elementary geometries
- Solving systems of polynomial inequalities in subexponential time
- Computational synthetic geometry
- The red book of varieties and schemes
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
- Affine embeddings of Sylvester-Gallai designs
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- On the real spectrum of a ring and its application to semialgebraic geometry
- Some outstanding problems in the theory of matrices
