D.4.18 modstd_lib

Library:

modstd.lib

Purpose:

Groebner bases of ideals/modules using modular methods

Authors:

A. Hashemi Amir.Hashemi@lip6.fr
G. Pfister pfister@mathematik.uni-kl.de
H. Schoenemann hannes@mathematik.uni-kl.de
A. Steenpass steenpass@mathematik.uni-kl.de
S. Steidel steidel@mathematik.uni-kl.de

Overview:

A library for computing Groebner bases of ideals/modules in the polynomial ring over the rational numbers using modular methods.

References:

E. A. Arnold: Modular algorithms for computing Groebner bases. J. Symb. Comp. 35, 403-419 (2003).

N. Idrees, G. Pfister, S. Steidel: Parallelization of Modular Algorithms. J. Symb. Comp. 46, 672-684 (2011).

Procedures:

D.4.18.1 modStd		standard basis of I using modular methods
D.4.18.2 modGB		standard basis of I using modular methods via cmd
D.4.18.3 modSyz		syzygy module of I using modular methods
D.4.18.4 modIntersect		intersection of I and J using modular methods