Computing H-bases via minimal bases for syzygy modules

DOI10.1080/03081087.2018.1539464zbMath1465.13024OpenAlexW2899193526WikidataQ114641358 ScholiaQ114641358MaRDI QIDQ4965915

Masoumeh Javanbakht, Amir Hashemi

Publication date: 18 March 2021

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1539464

zbMATH Keywords

Gröbner basesnull spacesyzygy moduleMacaulay matrixH-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 ⋮ Numerical computation of H-bases ⋮ MinimalHBases.mpl

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the null spaces of the Macaulay matrix
• Computing border bases
• Efficient polynomial reduction
• Refined algorithms to compute syzygies
• New constructive methods in classical ideal theory
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• H-bases for polynomial interpolation and system solving
• 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
• Gröbner bases, H–bases and interpolation
• Using Algebraic Geometry
• A Neural Network Modeled by an Adaptive Lotka-Volterra System
• The Canonical Decomposition of $\mathcal{C}^n_d$ and Numerical Gröbner and Border Bases