2000 character limit reached
On Algorithmic Estimation of Analytic Complexity for Polynomial Solutions to Hypergeometric Systems
Published 18 Jul 2020 in cs.SC and math.AP | (2007.09407v1)
Abstract: The paper deals with the analytic complexity of solutions to bivariate holonomic hypergeometric systems of the Horn type. We obtain estimates on the analytic complexity of Puiseux polynomial solutions to the hypergeometric systems defined by zonotopes. We also propose algorithms of the analytic complexity estimation for polynomials.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.