Home Online Manual
Top
Back: EulerProj
Forward: BelongSemig
FastBack:
FastForward:
Up: Singular Manual
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.15.5 cimonom_lib

Library:
cimonom.lib
Purpose:
Determines if the toric ideal of an affine monomial curve is a complete intersection

Authors:
I.Bermejo, [email protected]
I.Garcia-Marco, [email protected]
J.-J.Salazar-Gonzalez, [email protected]

Overview:
A library for determining if the toric ideal of an affine monomial curve is a complete intersection with NO NEED of computing explicitly a system of generators of such ideal. It also contains procedures to obtain the minimum positive multiple of an integer which is in a semigroup of positive integers. The procedures are based on a paper by Isabel Bermejo, Ignacio Garcia and Juan Jose Salazar-Gonzalez: 'An algorithm to check whether the toric ideal of an affine monomial curve is a complete intersection', Preprint.

Procedures:

D.15.5.1 BelongSemig  checks whether n is in the semigroup generated by v;
D.15.5.2 MinMult  computes k, the minimum positive integer such that k*a is in the semigroup of positive integers generated by the elements in b.
D.15.5.3 CompInt  checks wether I(d) is a complete intersection or not.
See also: Integer programming.