Explorerโ€บMathematicsโ€บMathematics
Research PaperResearchia:202609.21028

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 $\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...

Submitted: September 21, 2026Subjects: Mathematics; Mathematics

Description / Details

We show that there are integers NN and odd DD such that no algorithm can decide, from the rational coefficients of a homogeneous polynomial vector field F of degree DD in dimension NN, whether the origin is Lyapunov stable for Yห™=F(Y)\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

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Sep 21, 2026
Topic:
Mathematics
Area:
Mathematics
Comments:
0
Bookmark
Lyapunov stability of polynomial vector fields is undecidable | Researchia