Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleHypergeometric Polynomials and Integer Programming
Author(s) Mutsumi Saito, Bernd Sturmfels, Nobuki Takayama
TypeArticle in Journal
AbstractWe examine connections between A-hypergeometric 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 b-functions. In the second part, we study the indicial polynomial (b-function) 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.
KeywordsA-hypergeometric function, GKZ-system, integer programming, b-function, indical polynomial, Gröbner basis
Length20
ISSN0010-437X
File
URL dx.doi.org/10.1023/A:1000609524994
LanguageEnglish
JournalCompositio Mathematica
Volume115
Number2
Pages231-240
PublisherSpringer Science Business Media B.V.
Year1999
MonthFebruary
Translation No
Refereed No
Webmaster