Standard bases over Euclidean domains

DOI10.1016/J.JSC.2019.10.007zbMATH Open1444.13035arXiv1811.05736OpenAlexW2980529098WikidataQ114154467 ScholiaQ114154467MaRDI QIDQ2200296FDOQ2200296

Christian Eder, Gerhard Pfister, Adrian Popescu

Publication date: 19 September 2020

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

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.

Full work available at URL: https://arxiv.org/abs/1811.05736

Recommendations

• Effective computation of strong Gröbner bases over Euclidean domains
• Applications of strong Gröbner bases over Euclidean domains
• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
• scientific article; zbMATH DE number 3899033
• On signature-based Gröbner bases over Euclidean rings

zbMATH Keywords

algorithms[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]standard basesEuclidean domains

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites Work

• A Singular Introduction to Commutative Algebra
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• 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
• Modular algorithms for computing Gröbner bases.
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
• A general framework for Noetherian well ordered polynomial reductions
• Über die Deformation isolierter Singularitäten analytischer Mengen
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective computation of strong Gröbner bases over Euclidean domains
• Title not available (Why is that?)
• On an installation of Buchberger's algorithm
• On the D-bases of polynomial ideals over principal ideal domains
• Solving Polynomial Equation Systems
• On Signature-Based Gröbner Bases Over Euclidean Rings
• Resolution of singularities of an algebraic variety over a field of characteristic zero. II

Cited In (6)

• Standard Bases of a Vector Space Over a Linearly Ordered Incline
• On an implementation of standard bases and syzygies in SINGULAR
• 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

Uses Software

• Plural
• SINGULAR
• parallel.lib
• tasks.lib
• singular-benchmarks

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)