Lyapunov stability of polynomial vector fields is undecidable
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 $\dot Y=F(Y)$. This proves, for some large and unoptimized dimension and degree, a conjecture of V. I. Arnold. --- Source: arXiv:2609.22058v1 - http://arxiv.org/abs/2609.22058v1 PDF: https://arxiv.org/pdf/2609.22058v1 Original Link: http://arxiv.org/abs/2609.22058v1...
Description / Details
We show that there are integers and odd such that no algorithm can decide, from the rational coefficients of a homogeneous polynomial vector field F of degree in dimension , whether the origin is Lyapunov stable for . This proves, for some large and unoptimized dimension and degree, a conjecture of V. I. Arnold.
Source: arXiv:2609.22058v1 - http://arxiv.org/abs/2609.22058v1 PDF: https://arxiv.org/pdf/2609.22058v1 Original Link: http://arxiv.org/abs/2609.22058v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Sep 21, 2026
Mathematics
Mathematics
0