The continuous Skolem-Pisot problem

DOI10.1016/j.tcs.2010.06.005zbMath1215.68106OpenAlexW2010180140MaRDI QIDQ708215

Paul C. Bell, Raphaël M. Jungers, Jean-Charles Delvenne, Blondel, Vincent D.

Publication date: 11 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.005

zbMATH Keywords

ordinary differential equationsdecidabilityexponential polynomialscontinuous time dynamical systemSkolem-Pisot problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability (number-theoretic aspects) (11U05) Recurrences (11B37) Dynamical systems over global ground fields (37P15)

Related Items (9)

Analyzing ultimate positivity for solvable systems ⋮ Characterizing regions of attraction for piecewise affine systems by continuity of discrete transition functions ⋮ The computability of LQR and LQG control ⋮ On the decidability of reachability in continuous time linear time-invariant systems ⋮ Continuous-time orbit problems are decidable in polynomial-time ⋮ Reset control for synchronization of multi-agent systems ⋮ Scalable control of positive systems ⋮ A Biology-Inspired Approach to the Positive Integral Control of Positive Systems: The Antithetic, Exponential, and Logistic Integral Controllers ⋮ Reset control for consensus of double-integrator multi-agent systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Occurrence of zero in a linear recursive sequence
• The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
• Positivity of second order linear recurrent sequences
• Dissipative dynamical systems. II: Linear systems with quadratic supply rates
• Improved matrix pair undecidability results
• A note on recurring series
• Polynomial-time algorithm for the orbit problem
• Reachability in Linear Dynamical Systems
• The First Sign Change of a Cosine Polynomial
• Deux propriétés décidables des suites récurrentes linéaires
• On the combinatorial and algebraic complexity of quantifier elimination
• Linear forms in the logarithms of algebraic numbers
• On the Distribution of Values of Trigonometric Sums with Linearly Independent Frequencies
• A survey of computational complexity results in systems and control

This page was built for publication: The continuous Skolem-Pisot problem