A new algorithm for computing staggered linear bases

DOI10.1016/j.jsc.2022.11.003OpenAlexW4310066473MaRDI QIDQ2687265

Amir Hashemi, Hans-Michael Möller

Publication date: 1 March 2023

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2022.11.003

zbMATH Keywords

Gröbner basespolynomial idealsBuchberger's algorithmBuchberger's criteriastaggered linear bases

Mathematics Subject Classification ID

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

Related Items

Signature Gröbner bases in free algebras over rings

Uses Software

• Maple

Cites Work

• On the construction of Gröbner bases using syzygies
• Asymmetric approach to computation of Gröbner bases
• On an installation of Buchberger's algorithm
• Involutive bases of polynomial ideals
• 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
• Syzygies, finite length modules, and random curves
• A new framework for computing Gröbner bases
• Solving Polynomial Equation Systems
• Using Algebraic Geometry
• On the construction of staggered linear bases
• Ideals, Varieties, and Algorithms
• Computer Algebra in Scientific Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item