English

Computing Semi-algebraic Invariants for Polynomial Dynamical Systems

Symbolic Computation 2011-07-22 v2 Programming Languages

Abstract

In this paper, we consider an extended concept of invariant for polynomial dynamical system (PDS) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAI) for such PDSs. The main idea is encoding relevant dynamical properties as conditions on the high order Lie derivatives of polynomials occurring in the SAI. A direct consequence of this criterion is a relatively complete method of SAI generation based on template assumption and semi-algebraic constraint solving. Relative completeness means if there is an SAI in the form of a predefined template, then our method can indeed find one using this template.

Keywords

Cite

@article{arxiv.1102.0705,
  title  = {Computing Semi-algebraic Invariants for Polynomial Dynamical Systems},
  author = {Jiang Liu and Naijun Zhan and Hengjun Zhao},
  journal= {arXiv preprint arXiv:1102.0705},
  year   = {2011}
}

Comments

28 pages

R2 v1 2026-06-21T17:21:11.051Z