Modular Algorithms for Computing a Generating Set of the Syzygy Module

DOI10.1007/978-3-642-04103-7_23zbMath1239.13037OpenAlexW1520724363MaRDI QIDQ3644105

Masayuki Noro

Publication date: 10 November 2009

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04103-7_23

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 (1)

Usage of modular techniques for efficient computation of ideal operations

Uses Software

• Risa/Asir
• SINGULAR

Cites Work

• Strategies for computing minimal free resolutions
• Modular algorithms for computing Gröbner bases.
• A modular method to compute the rational univariate representation of zero-dimensional ideals
• Gröbner deformations of hypergeometric differential equations
• A Singular Introduction to Commutative Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Modular Algorithms for Computing a Generating Set of the Syzygy Module