Modular algorithms for computing Gröbner bases in free algebras

DOI10.1016/J.JSC.2026.102581MaRDI QIDQ7266913zbMATH OpenFDO

Authors Clemens Hofstadler, V. Levandovskyy

Publication date 16 June 2026

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

Full work available at URL https://doi.org/10.1016/J.JSC.2026.102581

zbMATH Keywords

multimodular methodsnoncommutative polynomialssignature Gröbner bases

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites work

• \textsf{f4ncgb}: high performance Gröbner basis computations in free algebras
• A Characterization of Perfect Strategies for Mirror Games
• A new efficient algorithm for computing Gröbner bases (F₄)
• A new framework for computing Gröbner bases
• A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers.
• A signature-based algorithm for computing the nondegenerate locus of a polynomial system
• A survey on signature-based algorithms for computing Gröbner bases
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Axioms for a theory of signature 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
• Fibonacci Series Modulo m
• Formal proofs of operator identities by a single formal computation
• Formally verifying proofs for algebraic identities of matrices
• Gröbner basis techniques in the computation of two-sided syzygies.
• scientific article; zbMATH DE number 4077463 (Why is no real title available?)
• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• scientific article; zbMATH DE number 705057 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• Letterplace ideals and non-commutative Gröbner bases.
• Mapping integers and Hensel codes onto Farey fractions
• Maximal quotient rational reconstruction
• Modular algorithms for computing Gröbner bases.
• Modular techniques for noncommutative Gröbner bases
• msolve. A library for solving polynomial systems
• Non-commutative Gröbner bases in algebras of solvable type
• On the cancellation rule in the homogenization
• One-sided noncommutative Gröbner bases with applications to computing Green's relations
• Ordering by Divisibility in Abstract Algebras
• P-adic reconstruction of rational numbers
• 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
• Some comments on the modular approach to Gröbner-bases
• The diamond lemma for ring theory
• The use of bad primes in rational reconstruction
• Universal truth of operator statements via ideal membership

This page was built for publication: Modular algorithms for computing Gröbner bases in free algebras

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