Top
Back: C.6.2.5 The algorithm of Bigatti, La Scala and Robbiano
Forward: C.6.4 Integer programming
FastBack: C. Mathematical background
FastForward: D. SINGULAR libraries
Up: C.6 Toric ideals and integer programming
Top: Singular 2-0-4 Manual
Contents: Table of Contents
Index: F. Index
About: About This Document

C.6.3 The Buchberger algorithm for toric ideals

Toric ideals have a very special structure that allows us to improve the Buchberger algorithm in many respects: They are prime ideals and generated by binomials. Pottier used this fact to describe all operations of the Buchberger algorithm on the ideal generators in terms of vector additions and subtractions. Some other strategies like multiple reduction (see [CoTr91]) or the use of bit vectors to represent the support of a monomial (see [Big97]) may be applied to more general ideals, but show to be especially useful in the toric case.


Top Back: C.6.2.5 The algorithm of Bigatti, La Scala and Robbiano Forward: C.6.4 Integer programming FastBack: C. Mathematical background FastForward: D. SINGULAR libraries Up: C.6 Toric ideals and integer programming Top: Singular 2-0-4 Manual Contents: Table of Contents Index: F. Index About: About This Document
            User manual for Singular version 2-0-4, October 2002, generated by texi2html.