Lyapunov stability of polynomial vector fields is undecidable
Milan Korda
Abstract
We show that there are integers N and odd D such that no algorithm can decide, from the rational coefficients of a homogeneous polynomial vector field F of degree D in dimension N, whether the origin is Lyapunov stable for Y=F(Y). This proves, for some large and unoptimized dimension and degree, a conjecture of V. I. Arnold.
Create a lesson
Related papers
Minimal sets for torus homeomorphisms with an irrational circle factor
Xiao-Chuan Liu
A new proof of no-wandering domain theorems without quasiconformal techniques
Zihao Ye
A finite Livshits theorem and local length spectrum rigidity
Jonathan DeWitt, Spencer Durham, James Marshall Reber et al.
Exponential separation of self-conformal systems
Antti Käenmäki
Long-time stability of hierarchical point vortex configurations
Slim Ibrahim, Shengyi Shen
Comparison and Almost Finiteness for Actions of Amenable Groups
Eli Glasner, Chunlin Liu