|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Decision Problems for Linear Recurrence Sequences
If you have a question about this talk, please contact Jonathan Hayman.
Linear recurrence sequences (such as the Fibonacci numbers) permeate a vast number of areas of mathematics and computer science (in particular: program termination and probabilistic verification), and also have many applications in other fields such as economics, theoretical biology, and statistical physics. In this talk, I will focus on three fundamental decision problems for linear recurrence sequences, namely the Skolem Problem (does the sequence have a zero?), the Positivity Problem (are all terms of the sequence positive?), and the Ultimate Positivity Problem (are all but finitely many terms of the sequence positive?).
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsJustice and Communities Research Unit, Anglia Ruskin University Historical Linguistics Research Cluster Kavli Institute for Cosmology - Summer Series
Other talksCGHR Research Group Lunchtime Talks Perspectives on the surface reactivity of actinides Diabetes in pregnancy: a hard case to swallow State-of-the-Art Tests of Lepton Number Violation and Seesaw Mechanisms Hagedorn wavepackets in phase space