Analyzing ultimate positivity for solvable systems
DOI10.1016/J.TCS.2015.10.023zbMATH Open1356.37035OpenAlexW2179190542MaRDI QIDQ897909FDOQ897909
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
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
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)
Cites Work
- Symbolic termination analysis of solvable loops
- Title not available (Why is that?)
- When can we detect that a P-finite sequence is positive?
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on recurring series
- Title not available (Why is that?)
- Computer Aided Verification
- Title not available (Why is that?)
- Generating all polynomial invariants in simple loops
- On the Positivity Problem for Simple Linear Recurrence Sequences,
- Positivity Problems for Low-Order Linear Recurrence Sequences
- Transcendental Numbers. (AM-16)
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- The continuous Skolem-Pisot problem
- Barrier certificates for nonlinear model validation
- Occurrence of zero in a linear recursive sequence
- Title not available (Why is that?)
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
- A simple proof of the Skolem-Mahler-Lech theorem
- Positivity of second order linear recurrent sequences
- Quantum automata and algebraic groups
- Positivity of third order linear recurrence sequences
- Title not available (Why is that?)
- Some decidable results on reachability of solvable systems
- TERMINATION ANALYSIS OF LINEAR LOOPS
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
Uses Software
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)
