Termination conditions for positivity proving procedures
From MaRDI portal
Publication:2963252
DOI10.1145/2465506.2465945zbMath1360.68951OpenAlexW1987402948MaRDI QIDQ2963252
Publication date: 10 February 2017
Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2465506.2465945
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Recurrences (11B37)
Related Items (8)
Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes ⋮ Computing error bounds for asymptotic expansions of regular P-recursive sequences ⋮ On the positivity of the Gillis-Reznick-Zeilberger rational function ⋮ Difference Equation Theory Meets Mathematical Finance ⋮ An extension of holonomic sequences: \(C^2\)-finite sequences ⋮ A comparison of algorithms for proving positivity of linearly recurrent sequences ⋮ An efficient procedure deciding positivity for a class of holonomic functions ⋮ A hypergeometric inequality
This page was built for publication: Termination conditions for positivity proving procedures
