| 
 | C.6.1 Toric ideals
Let  
The ideal
 ![\begin{displaymath}I_A:=(x^{u^+}-x^{u^-} \vert u\in\ker(A)\cap Z\!\!\! Z^n)\ \subset
K[x_1,\ldots,x_n] \end{displaymath}](sing_708.png)  is called a toric ideal. 
The first problem in computing toric ideals is to find a finite
generating set: Let 
   where   The required lattice basis can be computed using the LLL-algorithm ( system, see see [Coh93]). For the computation of the saturation, there are various possibilities described in the section Algorithms. 
 
 | 
|   |  |  |  |  |  |  |  |  |  |