An efficient procedure deciding positivity for a class of holonomic functions

DOI10.1145/2850449.2850458MaRDI QIDQ5270177zbMATH OpenOpenAlexFDO

Authors 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 of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Positive-Definiteness and its Applications to Interpolation Problems for Holomorphic Functions
• On the algebraic dependence of holonomic functions
• On Moment Problems with Holonomic Functions
• An extension of Zeilberger's fast algorithm to general holonomic functions
• On positivity sets for Helmholtz solutions
• Positivity and optimization for semi-algebraic functions
• Publication:4508900
• scientific article; zbMATH DE number 7724240
• Geometrical and analytical characterizations of positively homogeneous functions
• Fast evaluation of holonomic functions near and in regular singularities

Cites work

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

Cited in

(10)

• Difference Equation Theory Meets Mathematical Finance
• The Membership Problem for Hypergeometric Sequences with Quadratic Parameters
• scientific article; zbMATH DE number 7724240 (Why is no real title available?)
• On the complexity of robust eventual inequality testing for C-finite functions
• On the positivity of the Gillis-Reznick-Zeilberger rational function
• Holonomic techniques, periods, and decision problems (invited talk)
• The threshold problem for hypergeometric sequences with quadratic parameters
• Positivity proofs for linear recurrences through contracted cones
• Decision problems for second-order holonomic recurrences
• Deciding robust instances of an escape problem for dynamical systems in Euclidean space

Describes a project that uses

Uses Software

• SumCracker

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270177)