A signature-based algorithm for computing Gröbner bases over principal ideal domains

DOI10.1007/s11786-019-00432-5zbMath1454.13047arXiv1802.01388OpenAlexW2995980777MaRDI QIDQ782709

Maria Francis, Thibaut Verron

Publication date: 28 July 2020

Published in: Mathematics in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsGröbner basesprincipal ideal domainssignature-based algorithmspolynomials over rings

Mathematics Subject Classification ID

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

Related Items (1)

Axioms for a theory of signature bases

Uses Software

• Magma
• F5C

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective computation of strong Gröbner bases over Euclidean domains
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• Reduced Gröbner bases in polynomial rings over a polynomial ring
• On the construction of Gröbner bases using syzygies
• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
• On an installation of Buchberger's algorithm
• The Magma algebra system. I: The user language
• A survey on signature-based algorithms for computing Gröbner bases
• The F5 criterion revised
• On the complexity of the \(F_5\) Gröbner basis algorithm
• A new incremental algorithm for computing Groebner bases
• Signature rewriting in gröbner basis computation
• A new framework for computing Gröbner bases
• On ideal lattices, Gröbner bases and generalized hash functions
• On Signature-Based Gröbner Bases Over Euclidean Rings
• Practical Gröbner basis computation
• Signature-based algorithms to compute Gröbner bases
• Applications of strong Grobner bases over Euclidean domains

This page was built for publication: A signature-based algorithm for computing Gröbner bases over principal ideal domains