Decision problems for linear recurrences involving arbitrary real numbers

MaRDI QIDQ5155677zbMATH OpenFDO

Authors Eike Neumann

Publication date 8 October 2021

Full work available at URL https://arxiv.org/abs/2008.00583, https://lmcs.episciences.org/8346

zbMATH Keywords

computable analysislinear recurrencesSkolem problem

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Decision problems for linear recurrence sequences
• Positivity problems for low-order linear recurrence sequences
• Complexity of Restricted Variants of Skolem and Related Problems
• Ultimate positivity is decidable for simple linear recurrence sequences
• On the positivity problem for simple linear recurrence sequences

Cites work

• Algorithms in real algebraic geometry
• Comparing representations for function spaces in computable analysis
• Computability in linear algebra
• Computability on subsets of metric spaces.
• Computational problems in metric fixed point theory and their Weihrauch degrees
• Computer Science Logic
• Deux propriétés décidables des suites récurrentes linéaires
• Extended admissibility.
• scientific article; zbMATH DE number 3823893 (Why is no real title available?)
• scientific article; zbMATH DE number 1973372 (Why is no real title available?)
• scientific article; zbMATH DE number 1969324 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3349776 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• Occurrence of zero in a linear recursive sequence
• On the positivity problem for simple linear recurrence sequences
• On the positivity set of a linear recurrence sequence
• On the topological aspects of the theory of represented spaces
• Overt choice
• Positivity problems for low-order linear recurrence sequences
• Properly injective spaces and function spaces
• Theory of representations
• Ultimate positivity is decidable for simple linear recurrence sequences

Cited in

(4)

• On robustness for the Skolem, positivity and ultimate positivity problems
• On the complexity of robust eventual inequality testing for C-finite functions
• Quantifiying the robustness of dynamical systems. Relating time and space to length and precision
• Robust positivity problems for linear recurrence sequences: the frontiers of decidability for explicitly given neighbourhoods

This page was built for publication: Decision problems for linear recurrences involving arbitrary real numbers

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