No label defined (Q4232489)

The authors review the known algorithms for performing the basic algorithms for ideal and submodule operations: intersection, transporter and saturation. The algorithms known in the literature for these operations on polynomial rings fall into two classes: syzygy algorithms and elimination algorithms. The authors show that the two classes substantially coincide. They show moreover that these algorithms can be generalized to another algorithm, a module elimination algorithm, that allows the use of a Hilbert function driven algorithm, and that appears to be the most efficient algorithm in this class. The paper contains 4 sections: Section 1. Intersections, Section 2. Transporter, Section 3. Saturation, and Section 4. Experiments. For the entire collection see [Zbl 0903.00083].