The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations

Details The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations

2008-09-12

arxiv.org/abs/0809.2189v2

Mathematics

Dynamical Systems

14 pages, no figure

Scientific paper

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the nonnegativity problem is NP-hard in general and we show that the presence of a zero is decidable for several subcases, including instances of depth two or less, although the decidability in general is left open. The problems may also be stated as reachability problems related to real zeros of exponential polynomials or solutions to initial value problems of linear differential equations, which are interesting problems in their own right.

Affiliated with

Also associated with

No associations

Rating

The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-369203