An efficient procedure deciding positivity for a class of holonomic functions

DOI10.1145/2850449.2850458zbMath1365.68501OpenAlexW2314095751MaRDI QIDQ5270177

Veronika Pillwein, Miriam Schussler

Publication date: 22 June 2017

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2850449.2850458

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Related Items (3)

The Membership Problem for Hypergeometric Sequences with Quadratic Parameters ⋮ On the positivity of the Gillis-Reznick-Zeilberger rational function ⋮ Difference Equation Theory Meets Mathematical Finance

Uses Software

• SumCracker

Cites Work

• SumCracker: A package for manipulating symbolic sums and related objects
• When can we detect that a P-finite sequence is positive?
• Termination conditions for positivity proving procedures
• A procedure for proving special function inequalities involving a discrete parameter

This page was built for publication: An efficient procedure deciding positivity for a class of holonomic functions