"Termination Conditions for Positivity Proving Procedures"
: Proceedings of ISSAC 2013, ACM, New York, Seite(n) 315-322, 2013, ISBN: 978-1-4503-2059-7
Termination Conditions for Positivity Proving Procedures
Sprache des Titels:
Proceedings of ISSAC 2013
Proving positivity of a sequence given by a linear recurrence with polynomial coefficients (P-finite recurrence) is a non-trivial task for both humans and computers. Algorithms dealing with this task are rare or non-existent. One method that was introduced in the last decade by Gerhold and Kauers succeeds on many examples, but termination of this procedure has been proven so far only up to order three for special cases. Here we present an analysis that extends the previously known termination results on recurrences of order three, and also provides termination conditions for recurrences of higher order.