Standard bases over Euclidean domains
From MaRDI portal
Publication:2200296
Abstract: In this paper we state and explain techniques useful for the computation of strong Gr"obner and standard bases over Euclidean domains: First we investigate several strategies for creating the pair set using an idea by Lichtblau. Then we explain methods for avoiding coefficient growth using syzygies. We give an in-depth discussion on normal form computation resp. a generalized reduction process with many optimizations to further avoid large coefficients. These are combined with methods to reach GCD-polynomials at an earlier stage of the computation. Based on various examples we show that our new implementation in the computer algebra system Singular is, in general, more efficient than other known implementations.
Recommendations
Cites work
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 3899033 (Why is no real title available?)
- scientific article; zbMATH DE number 3907766 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 2166957 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- A Singular Introduction to Commutative Algebra
- A general framework for Noetherian well ordered polynomial reductions
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Effective computation of strong Gröbner bases over Euclidean domains
- Modular algorithms for computing Gröbner bases.
- On an installation of Buchberger's algorithm
- On signature-based Gröbner bases over Euclidean rings
- On the D-bases of polynomial ideals over principal ideal domains
- Resolution of singularities of an algebraic variety over a field of characteristic zero. I
- Resolution of singularities of an algebraic variety over a field of characteristic zero. II
- Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
- Über die Deformation isolierter Singularitäten analytischer Mengen
Cited in
(8)- On an implementation of standard bases and syzygies in SINGULAR
- Standard Bases of a Vector Space Over a Linearly Ordered Incline
- Applications of strong Gröbner bases over Euclidean domains
- Strong Gröbner bases and linear algebra in multivariate polynomial rings over Euclidean domains
- Standard bases in differential algebra
- Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra
- Computing free non-commutative Gröbner bases over \(\mathbb{Z}\) with \textsc{Singular:Letterplace}
- On two signature variants of Buchberger's algorithm over principal ideal domains
This page was built for publication: Standard bases over Euclidean domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200296)
