Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
From MaRDI portal
Publication:2133928
DOI10.1016/j.jsc.2022.04.001zbMath1502.16049arXiv2107.14675OpenAlexW4226434942MaRDI QIDQ2133928
Clemens Hofstadler, Thibaut Verron
Publication date: 5 May 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.14675
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Gröbner-Shirshov bases (16Z10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Letterplace ideals and non-commutative Gröbner bases.
- The diamond lemma for ring theory
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An introduction to commutative and noncommutative Gröbner bases
- A survey on signature-based algorithms for computing Gröbner bases
- Formally verifying proofs for algebraic identities of matrices
- Formal proofs of operator identities by a single formal computation
- The F5 criterion revised
- A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers.
- A new incremental algorithm for computing Groebner bases
- A new framework for computing Gröbner bases
- Solving Polynomial Equation Systems
- Computer simplification of formulas in linear systems theory
- Compatible rewriting of noncommutative polynomials for proving operator identities
- Letterplace
- Practical Gröbner basis computation
- A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
- Signature-based algorithms to compute Gröbner bases
- A generalized criterion for signature related Gröbner basis algorithms
- Certifying operator identities via noncommutative Gröbner bases
