University of Birmingham > Talks@bham > Theoretical computer science seminar > Decision problems for linear recurrence sequences

Decision problems for linear recurrence sequences

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Paul Levy.

Linear recurrence sequences are ubiquitous in discrete mathematics and appear in diverse areas of computer science, including term rewriting, probabilistic verification, and termination analysis for while loops. In this talk we consider three fundamental decision problems associated with linear recurrence sequences: the Skolem problem (is the sequence ever zero), the positivity problem (is the sequence always positive) and the ultimate positivity problem (is the sequence ultimately positive). We describe what is known about these problems, including some new decidability and hardness results for the positivity and ultimate positivity problems.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.