Details:
Title  Hypergeometric Polynomials and Integer Programming  Author(s)  Mutsumi Saito, Bernd Sturmfels, Nobuki Takayama  Type  Article in Journal  Abstract  We examine connections between Ahypergeometric differential equations and the theory of integer programming. In the first part, we develop a lsquohypergeometric sensitivity analysisrsquo for small variations of constraint constants with creation operators and bfunctions. In the second part, we study the indicial polynomial (bfunction) along the hyperplane xi=0 via a correspondence between the optimal value of an integer programming problem and the roots of the indicial polynomial. Gröbner bases are used to prove theorems and give counter examples.  Keywords  Ahypergeometric function, GKZsystem, integer programming, bfunction, indical polynomial, Gröbner basis  Length  20  ISSN  0010437X 
File 
 URL 
dx.doi.org/10.1023/A:1000609524994 
Language  English  Journal  Compositio Mathematica  Volume  115  Number  2  Pages  231240  Publisher  Springer Science Business Media B.V.  Year  1999  Month  February  Translation 
No  Refereed 
No 
