|
C.6.1 Toric ideals
Let
The ideal
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.
|
| |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |