Analyzing ultimate positivity for solvable systems

DOI10.1016/J.TCS.2015.10.023MaRDI QIDQ897909zbMATH OpenOpenAlexFDO

Authors Ming Xu, Cheng-Chao Huang, Zhibin Li, Zhenbing Zeng

Publication date 8 December 2015

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

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

zbMATH Keywords

computational algebraic geometrydynamical systemnumber theorydecision procedurepositivity problem

Mathematics Subject Classification ID

Generic properties, structural stability of dynamical systems (37C20) Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• Ultimate positivity is decidable for simple linear recurrence sequences
• Positiveness of dynamic systems with nonpositive coefficient matrices
• Positivity problems for low-order linear recurrence sequences
• On the positivity problem for simple linear recurrence sequences
• Positivity of third order linear recurrence sequences

Cites work

• scientific article; zbMATH DE number 3823893 (Why is no real title available?)
• scientific article; zbMATH DE number 3920595 (Why is no real title available?)
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 3421926 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A note on recurring series
• A simple proof of the Skolem-Mahler-Lech theorem
• Barrier certificates for nonlinear model validation
• Computer Aided Verification
• Cylindrical Algebraic Decomposition I: The Basic Algorithm
• Generating all polynomial invariants in simple loops
• Occurrence of zero in a linear recursive sequence
• On the positivity problem for simple linear recurrence sequences
• Positivity of second order linear recurrent sequences
• Positivity of third order linear recurrence sequences
• Positivity problems for low-order linear recurrence sequences
• Quantum automata and algebraic groups
• Some decidable results on reachability of solvable systems
• Symbolic termination analysis of solvable loops
• TERMINATION ANALYSIS OF LINEAR LOOPS
• The continuous Skolem-Pisot problem
• The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
• Transcendental Numbers. (AM-16)
• Ultimate positivity is decidable for simple linear recurrence sequences
• When can we detect that a P-finite sequence is positive?

Describes a project that uses

Uses Software

• REACH
• TERMINATOR

This page was built for publication: Analyzing ultimate positivity for solvable systems

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