On Algorithmic Estimation of Analytic Complexity for Polynomial Solutions to Hypergeometric Systems
From MaRDI portal
Publication:6345360
DOI10.17516/1997-1397-2020-13-6-718-732zbMATH Open1534.33012arXiv2007.09407MaRDI QIDQ6345360FDOQ6345360
Authors: V. A. Krasikov 
Publication date: 18 July 2020
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.
Power series (including lacunary series) in one complex variable (30B10) Function-theoretic methods (including power series methods and semicontinuous methods) for summability (40C15) Appell, Horn and Lauricella functions (33C65)
This page was built for publication: On Algorithmic Estimation of Analytic Complexity for Polynomial Solutions to Hypergeometric Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345360)
