Analyzing ultimate positivity for solvable systems
From MaRDI portal
Publication:897909
DOI10.1016/j.tcs.2015.10.023zbMath1356.37035OpenAlexW2179190542MaRDI QIDQ897909
Zhi-Bin Li, Cheng-Chao Huang, Zhenbing Zeng, Ming Xu
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
Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Generic properties, structural stability of dynamical systems (37C20)
Uses Software
Cites Work
- The continuous Skolem-Pisot problem
- Positivity of third order linear recurrence sequences
- Occurrence of zero in a linear recursive sequence
- A simple proof of the Skolem-Mahler-Lech theorem
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
- Symbolic termination analysis of solvable loops
- Quantum automata and algebraic groups
- Generating all polynomial invariants in simple loops
- Positivity of second order linear recurrent sequences
- Barrier certificates for nonlinear model validation
- A note on recurring series
- Some decidable results on reachability of solvable systems
- When can we detect that a P-finite sequence is positive?
- TERMINATION ANALYSIS OF LINEAR LOOPS
- On the Positivity Problem for Simple Linear Recurrence Sequences,
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Computer Aided Verification
- Positivity Problems for Low-Order Linear Recurrence Sequences
- Transcendental Numbers. (AM-16)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Analyzing ultimate positivity for solvable systems
