Termination conditions for positivity proving procedures
From MaRDI portal
Publication:2963252
DOI10.1145/2465506.2465945zbMATH Open1360.68951OpenAlexW1987402948MaRDI QIDQ2963252FDOQ2963252
Authors: Veronika Pillwein
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
Recommendations
Symbolic computation and algebraic computation (68W30) Recurrences (11B37) Number-theoretic algorithms; complexity (11Y16)
Cited In (13)
- Term Rewriting and Applications
- A hypergeometric inequality
- A comparison of algorithms for proving positivity of linearly recurrent sequences
- Recurrence relations, succession rules and the positivity problem
- An extension of holonomic sequences: \(C^2\)-finite sequences
- Computing error bounds for asymptotic expansions of regular P-recursive sequences
- When can we detect that a P-finite sequence is positive?
- Difference Equation Theory Meets Mathematical Finance
- Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes
- On \(C^2\)-finite sequences
- An efficient procedure deciding positivity for a class of holonomic functions
- Hypergeometric-type sequences
- On the positivity of the Gillis-Reznick-Zeilberger rational function
This page was built for publication: Termination conditions for positivity proving procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963252)