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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
