Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
From MaRDI portal
Publication:5167849
DOI10.1007/978-3-662-43951-7_28zbMath1410.11135arXiv1309.1914OpenAlexW2963754540MaRDI QIDQ5167849
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1914
Analysis of algorithms and problem complexity (68Q25) Decidability (number-theoretic aspects) (11U05) Recurrences (11B37)
Related Items (22)
Model checking QCTL plus on quantum Markov chains ⋮ Unnamed Item ⋮ What's decidable about discrete linear dynamical systems? ⋮ Analyzing ultimate positivity for solvable systems ⋮ Unnamed Item ⋮ Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems ⋮ Unnamed Item ⋮ On the Identity Problem for the Special Linear Group and the Heisenberg Group. ⋮ Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) ⋮ Exact optimal values of step-size coefficients for boundedness of linear multistep methods ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ First-order orbit queries ⋮ Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem ⋮ Complexity of Restricted Variants of Skolem and Related Problems ⋮ O-Minimal Invariants for Discrete-Time Dynamical Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On eventual non-negativity and positivity for the weighted sum of powers of matrices ⋮ A robust class of linear recurrence sequences ⋮ Algebraic model checking for discrete linear dynamical systems
This page was built for publication: Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
