\textsf{f4ncgb}: high performance Gröbner basis computations in free algebras

DOI10.1007/978-3-032-09645-6_5MaRDI QIDQ6851545zbMATH OpenFDO

Authors Maximilian Heisinger, Clemens Hofstadler

Publication date 27 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-09645-6_5

zbMATH Keywords

C++ libraryGröbner-Shirshov basesnoncommutative polynomialssoftware

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A Characterization of Perfect Strategies for Mirror Games
• A new efficient algorithm for computing Gröbner bases (F₄)
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Certifying operator identities via noncommutative Gröbner bases
• Compatible rewriting of noncommutative polynomials for proving operator identities
• Computer simplification of formulas in linear systems theory
• Existence of quantum symmetries for graphs on up to seven vertices. A computer based approach
• Formally verifying proofs for algebraic identities of matrices
• How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse; A Case Study
• scientific article; zbMATH DE number 4077463 (Why is no real title available?)
• scientific article; zbMATH DE number 3544216 (Why is no real title available?)
• scientific article; zbMATH DE number 705057 (Why is no real title available?)
• Ideals, Varieties, and Algorithms
• Letterplace
• Letterplace ideals and non-commutative Gröbner bases.
• Linear algebraic approach to Gröbner-Shirshov basis theory
• Modern computer algebra
• Modular algorithms for computing Gröbner bases.
• Modular forms, a computational approach. With an appendix by Paul E. Gunnells
• msolve. A library for solving polynomial systems
• Opal: a system for computing noncommutative Gröbner bases
• Parallelization of modular algorithms
• Short proofs of ideal membership
• Signature Gröbner bases in free algebras over rings
• Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
• Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
• The diamond lemma for ring theory
• The Magma algebra system. I: The user language

Cited in

(1)

• Modular algorithms for computing Gröbner bases in free algebras

This page was built for publication: \textsf{f4ncgb}: high performance Gröbner basis computations in free algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851545)