Axioms for a theory of signature bases
From MaRDI portal
Publication:6149142
Abstract: Twenty years after the discovery of the F5 algorithm, Gr"obner bases with signatures are still challenging to understand and to adapt to different settings. This contrasts with Buchberger's algorithm, which we can bend in many directions keeping correctness and termination obvious. I propose an axiomatic approach to Gr"obner bases with signatures with the purpose of uncoupling the theory and the algorithms, and giving general results applicable in many different settings (e.g. Gr"obner for submodules, F4-style reduction, noncommutative rings, non-Noetherian settings, etc.).
Recommendations
- A survey on signature-based algorithms for computing Gröbner bases
- Signature-based algorithms to compute Gröbner bases
- A new signature-based algorithms for computing Gröbner bases
- Simple signature based iterative algorithm for calculation of Gröbner bases
- A generalized criterion for signature related Gröbner basis algorithms
Cites work
- scientific article; zbMATH DE number 1241624 (Why is no real title available?)
- scientific article; zbMATH DE number 1263375 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 1795734 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (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 new efficient algorithm for computing Gröbner bases (F₄)
- A new framework for computing Gröbner bases
- A new incremental algorithm for computing Groebner bases
- A new proof for the correctness of the F5 algorithm
- A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
- A signature-based algorithm for computing Gröbner bases over principal ideal domains
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system
- A survey on signature-based algorithms for computing Gröbner bases
- A tropical F5 algorithm
- Advances in Cryptology - CRYPTO 2003
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An introduction to commutative and noncommutative 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
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Corrigendum to: ``The F5 criterion revised
- Extended \(F_5\) criteria
- Extending the GVW Algorithm to Local Ring
- Gröbner basis over semigroup algebras. Algorithms and applications for sparse polynomial systems
- Hilbert functions and the Buchberger algorithm
- Ideals, Varieties, and Algorithms
- Methods for computing in algebraic geometry and commutative algebra
- On Affine Tropical F5 Algorithms
- On an installation of Buchberger's algorithm
- On signature-based Gröbner bases over Euclidean rings
- On the complexity of the \(F_5\) Gröbner basis algorithm
- On the construction of staggered linear bases
- Ordering by Divisibility in Abstract Algebras
- Polynomial algorithms in computer algebra
- Practical Gröbner basis computation
- Signature Gröbner bases in free algebras over rings
- Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
- Signature rewriting in Gröbner basis computation
- Signature-based algorithms for Gröbner bases over tate algebras
- Signature-based algorithms to compute Gröbner bases
- Termination of the F5 algorithm
- The F5 criterion revised
- The Magma algebra system. I: The user language
This page was built for publication: Axioms for a theory of signature bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149142)
