| Popis: |
Deciding positivity for recursively defined sequences based on only the recursive description as input is usually a non-trivial task. Even in the case of $C$-finite sequences, i.e., sequences satisfying a linear recurrence with constant coefficients, this is only known to be decidable for orders up to five. In this paper, we discuss several methods for proving positivity of $C$-finite sequences and compare their effectiveness on input from the Online Encyclopedia of Integer Sequences (OEIS). |
