| #### C.6.2.2 The algorithm of Pottier The algorithm of Pottier (see [Pot94]) starts by computing a lattice basis 585#585 for the integer kernel of 190#190using the LLL-algorithm ( system). The ideal corresponding to the lattice basis vectors 764#764 is saturated – as in the algorithm of Conti and Traverso – by inversion of all variables: One adds an auxiliary variable 501#501 and the generator 765#765 to obtain an ideal 761#761 in 766#766 from which one computes 750#750 by elimination of 501#501.

User manual for Singular version 4.4.0, 2024, generated by texi2html.