Decision problems for linear recurrence sequences

DOI10.1007/978-3-642-33512-9_3MaRDI QIDQ4899140zbMATH OpenOpenAlexFDO

Publication date 7 January 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33512-9_3

Decidability of theories and sets of sentences (03B25) Recurrences (11B37) Decidability (number-theoretic aspects) (11U05)

Recommendations

Positivity problems for low-order linear recurrence sequences
Complexity of Restricted Variants of Skolem and Related Problems
On the positivity problem for simple linear recurrence sequences
Positivity of third order linear recurrence sequences
Effective results on the Skolem problem for linear recurrence sequences

Cited in

(37)

The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
Effective results on the Skolem problem for linear recurrence sequences
Exact optimal values of step-size coefficients for boundedness of linear multistep methods
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
An extension of holonomic sequences: C^2-finite sequences
On eventual non-negativity and positivity for the weighted sum of powers of matrices
Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
Lonely points in simplices
Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes
On Affine Reachability Problems
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
Complexity of Restricted Variants of Skolem and Related Problems
On the skolem problem and prime powers
Decision problems for linear recurrences involving arbitrary real numbers
On the positivity problem for simple linear recurrence sequences
Ultimate positivity is decidable for simple linear recurrence sequences
Positivity problems for low-order linear recurrence sequences
Approximate verification of the symbolic dynamics of Markov chains
Order bounds for C2-finite sequences
Magic Numbers in Periodic Sequences
On the abcabc conjecture in algebraic number fields
A probabilistic logic for verifying continuous-time Markov chains
MDPs as distribution transformers: affine invariant synthesis for safety objectives
Hypergeometric-type sequences
Positivity-hardness results on Markov decision processes
Porous invariants for linear systems
On the Skolem problem and the Skolem conjecture
On C^2-finite sequences
Positive moments forever: undecidable and decidable cases
Fuchsian holonomic sequences
Effective isotrivial Mordell-Lang in positive characteristic
The continuous Skolem-Pisot problem
Omega-regular verification and control for distributional specifications in MDPs
Chance and mass interpretations of probabilities in Markov decision processes
Aperiodicity in quantum Wang tilings
Porous invariants

This page was built for publication: Decision problems for linear recurrence sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899140)