On the Positivity Problem for Simple Linear Recurrence Sequences,
From MaRDI portal
Publication:5167848
DOI10.1007/978-3-662-43951-7_27zbMath1410.11134arXiv1309.1550OpenAlexW1864094877MaRDI QIDQ5167848
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.1550
Analysis of algorithms and problem complexity (68Q25) Decidability (number-theoretic aspects) (11U05) Recurrences (11B37)
Related Items (23)
Unnamed Item ⋮ Ultimate periodicity problem for linear numeration systems ⋮ Sequential Relational Decomposition ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 ⋮ What's decidable about discrete linear dynamical systems? ⋮ Analyzing ultimate positivity for solvable systems ⋮ Unnamed Item ⋮ On the Identity Problem for the Special Linear Group and the Heisenberg Group. ⋮ A switch convergence for a small perturbation of a linear recurrence equation ⋮ Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) ⋮ Exact optimal values of step-size coefficients for boundedness of linear multistep methods ⋮ Toric varieties from cyclic matrix semigroups ⋮ Quadratic maximization of reachable values of affine systems with diagonalizable matrix ⋮ Unnamed Item ⋮ On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond ⋮ On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond ⋮ Complexity of Restricted Variants of Skolem and Related Problems ⋮ O-Minimal Invariants for Discrete-Time Dynamical Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A robust class of linear recurrence sequences ⋮ Dold sequences, periodic points, and dynamics ⋮ Algebraic model checking for discrete linear dynamical systems
This page was built for publication: On the Positivity Problem for Simple Linear Recurrence Sequences,
