The continuous Skolem-Pisot problem

@article{Bell2010TheCS,
  title={The continuous Skolem-Pisot problem},
  author={Paul Bell and Jean-Charles Delvenne and Rapha{\"e}l M. Jungers and Vincent D. Blondel},
  journal={Theor. Comput. Sci.},
  year={2010},
  volume={411},
  pages={3625-3634}
}
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… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
13 Citations
29 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Skolem’s Problem - On the Border between Decidability and Undecidability

  • V. Halava, T. Harju, M. Hirvensalo, J. Karhumäki
  • TUCS Technical Report Number 683
  • 2005
1 Excerpt

A

  • G. Everest
  • van der Poorten, I. Shparlinski, T. Ward…
  • 2003
1 Excerpt

Liouville’s Approximation Theorem

  • T. Apostol
  • in: Modular Functions and Dirichlet Series in…
  • 1997

Similar Papers

Loading similar papers…