On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
The Skolem problem is a long-standing open problem in linear dynamical systems: can a linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly, the positivity problem asks whether the LRS stays positive from an initial configuration. Deciding Skolem (or positivity)...
| Главные авторы: | , , , |
|---|---|
| Формат: | Статья |
| Язык: | English |
| Опубликовано: |
Logical Methods in Computer Science e.V.
2024-06-01
|
| Серии: | Logical Methods in Computer Science |
| Предметы: | |
| Online-ссылка: | https://lmcs.episciences.org/10261/pdf |