Positivity certificates for P-recursive sequences

Abstract

We extend the decidability of the positivity problem for P-recursive sequences of Poincaré type having one simple dominant eigenvalue and generic initial conditions. We give an algorithm that produces a certificate of positivity that is a data-structure for a proof by induction. The main ingredient of our approach is the existence of a positive cone which is stable by the iteration of the recurrence.