On computing Hilbert bases via the Elliot-MacMahon algorithm

The ways of using the Elliot-MacMahon algorithm to compute the Hilbert base of a system of linear Diophantine equations known so far are either not efficient or can fail to terminate. We present a version of an algorithm exploiting this range of ideas, which however is reasonably efficient as well as finite.

[1]  Claude Kirchner,et al.  AC-Unification Race: The System Solving Approach, Implementation and Benchmarks , 1992, J. Symb. Comput..

[2]  Eric Domenjoud,et al.  From Elliott-MacMahon to an Algorithm for General Linear Constraints on Naturals , 1995, CP.

[3]  Günter M. Ziegler.  Gröbner Bases and Integer Programming , 1999 .

[4]  B. Sturmfels.  Gröbner bases and convex polytopes , 1995 .

[5]  Richard P. Stanley,et al.  Magic labelings of graphs, symmetric magic squares, systems of parameters, and Cohen-Macaulay rings , 1976 .

[6]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[7]  Loïc Pottier.  Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms , 1991, RTA.

[8]  Robert Weismantel,et al.  The height of minimal Hilbert bases , 1997 .

[9]  Evelyne Contejean,et al.  An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations , 1994, Inf. Comput..

[10]  Claude Kirchner,et al.  AC-Unification Race: The System Solving Approach And Its Implementation , 1990, DISCO.

[11]  Rekha R. Thomas.  A Geometric Buchberger Algorithm for Integer Programming , 1995, Math. Oper. Res..

[12]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[13]  C. Hoede,et al.  Magic labellings of graphs , 1999 .

[14]  G. Ziegler.  Lectures on Polytopes , 1994 .

[15]  Arjeh M. Cohen,et al.  Some tapas of computer algebra , 1999, Algorithms and computation in mathematics.

[16]  Robert Weismantel,et al.  On Hilbert bases of polyhedral cones , 1996 .

[17]  Richard P. Stanley,et al.  Linear homogeneous Diophantine equations and magic labelings of graphs , 1973 .