2010/05/04 by Kauers, Manuel, Pillwein, Veronika · 2 citations
#FOS: Computer and information sciences #G.2.1 #I.1.2 #Symbolic Computation (cs.SC)
paper · doi:10.48550/arxiv.1005.0600
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.