- An implementation by maple to get recurrence relations.
This program is an implementation of the algorithm to get recurrence rerations of binomial sums described in the paper "Algorithm finding recurrence relations of binomial sums and its complexity".

- An implementation by Mathematica to get all feasible points for the transportation problem.
See the paper "Integer programming and Hypergeometric polynomias" by M.Saito, B.Sturmfels and N.Takayama on this program.

- An implementation by Mathematica to get all feasible points for the transportation problem based on contiguity relations.
See the paper "Integer programming and Hypergeometric polynomias" by M.Saito, B.Sturmfels and N.Takayama on this program.

- An implementation by kan/sm1 to get
contiguity relations by Grobner basis computation in the Weyl algebra.
See the paper "Integer programming and Hypergeometric polynomias" by M.Saito, B.Sturmfels and N.Takayama on this program.

taka@math.s.kobe-u.ac.jp