Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of ISSAC 2013 |
| Place of Publication | New York |
| Publisher | ACM |
| Pages | 315-322 |
| Number of pages | 8 |
| ISBN (Print) | 978-1-4503-2059-7 |
| DOIs | |
| Publication status | Published - 2013 |
Fields of science
- 101001 Algebra
- 101002 Analysis
- 101 Mathematics
- 102 Computer Sciences
- 102011 Formal languages
- 101009 Geometry
- 101013 Mathematical logic
- 101020 Technical mathematics
- 101025 Number theory
- 101012 Combinatorics
- 101005 Computer algebra
- 101006 Differential geometry
- 101003 Applied geometry
- 102025 Distributed systems
JKU Focus areas
- Computation in Informatics and Mathematics
- Engineering and Natural Sciences (in general)