Termination conditions for positivity proving procedures

DOI10.1145/2465506.2465945MaRDI QIDQ2963252zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

positivitycylindrical decompositionP-finite sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Recurrences (11B37) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• When can we detect that a P-finite sequence is positive?
• Positivity of third order linear recurrence sequences
• Positivity of three-term recurrence sequences
• Recurrence relations, succession rules, and the positivity problem
• Positivity problem of three-term recurrence sequences

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
• An efficient procedure deciding positivity for a class of holonomic functions
• On \(C^2\)-finite sequences
• On the positivity of the Gillis-Reznick-Zeilberger rational function
• Hypergeometric-type sequences

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)