Master thesis - Speciale: Computing Grobner fans of toric ideals

The thesis is partly based on the paper "Computing Grobner fans of toric ideals" by Huber and Thomas.
Using various tricks a computer program more than 30 times faster than the original one is developed.
The thesis is available in postscript format and in PDF format.
Here is my program for computing Grobner fans of toric ideals: toric.tar . For UNIX or LINUX.
Put the file in a separate dir and use tar -x < toric.tar to extract.
The format of the ascii representation for a matrix is {(1,1)(1,2)(1,3)}
It uses the simplex algorithm implementation by Huber.
The implementation by Huber and Thomas can be found at http://www.math.washington.edu/~thomas/programs.html .

Updates:

  • Added Jan 12 2003: There seems to be an error in the table on page 65 in the thesis. Using the features of the new program the edge graph of the state polytope of example HA9 has been recomputed. It consists of 583370 (not 593371) vertices and 2615799 (not 2615804) edges. On the other hand the numbers of example A10 have been confirmed. Most likely the error was a numerical error in the simplex algorithm.
  • Added Jan 5 2003: A new version of the proram is available. It is called CaTS .
  • Added Oct 11 2002: Guide on how to use the program .