Philipp Nuspl, Veronika Elisabeth Pillwein,
"A comparison of algorithms for proving positivity of linearly recurrent sequences"
, Serie RISC Report Series, Johannes Kepler University Linz, Austria, Nummer 22-05, RISC, JKU, Hagenberg, Linz, 5-2022, ISBN: 2791-4267
Original Titel:
A comparison of algorithms for proving positivity of linearly recurrent sequences
Sprache des Titels:
Englisch
Original Kurzfassung:
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).
Sprache der Kurzfassung:
Englisch
Veröffentlicher:
RISC, JKU
Verlagsanschrift:
Hagenberg, Linz
Serie:
RISC Report Series, Johannes Kepler University Linz, Austria
Forschungs-