author = {Manuel Kauers and Veronika Pillwein},
title = {{When can we detect that a P-finite sequence is positive?}},
booktitle = {{Proceedings of ISSAC'10}},
language = {english},
abstract = {We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed on a great many examples, there is no guarantee for them to terminate, and they do in fact not terminate for every input. For some restricted classes of P-finite recurrence equations of order up to three we provide a priori criteria that assert the termination of the algorithms.},
pages = {195--202},
isbn_issn = {978-1-4503-0150-3},
year = {2010},
editor = {Stephen Watt},
refereed = {yes},
length = {7}