Positivity of second order linear recurrent sequences

Authors:
Vesa Halava;Tero Harju;Mika Hirvensalo
Affiliations:
Department of Mathematics and TUCS - Turku Centre for Computer Science, University of Turku, Turku, Finland;Department of Mathematics and TUCS - Turku Centre for Computer Science, University of Turku, Turku, Finland;Department of Mathematics and TUCS - Turku Centre for Computer Science, University of Turku, Turku, Finland
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 1
Cited 4

Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series

Another proof of Soittola's theorem

Theoretical Computer Science
Positivity of third order linear recurrence sequences

Discrete Applied Mathematics
Buyback problem: approximate matroid intersection with cancellation costs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Decision problems for linear recurrence sequences

RP'12 Proceedings of the 6th international conference on Reachability Problems

Quantified Score

Hi-index	0.05

Visualization

Abstract

We give a decision method for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by un = aun-1 + bun-2 has only nonnegative terms.