English

Generalized ODE reduction algorithm with bounded degree transformation

Symbolic Computation 2025-08-14 v1

Abstract

As a generalization of our previous result\cite{huang2025algorithm}, this paper aims to answer the following question: Given a 2-dimensional polynomial vector field y=M(x,y)N(x,y)y^{\prime}=\frac{M(x,y)}{N(x,y)}, how to find a rational transformation yA(x,y)B(x,y)y \to \frac{A(x,y)}{B(x,y)} with bounded degree numerator, the inverse of which transforms this vector field into a simpler form y=i=0nfi(x)yiy^{\prime}=\sum_{i=0}^nf_i(x)y^i. Such a structure, often known as the generalized Abel equation and has been studied in various areas, provides a deeper insight into the property of the original vector field. We have implemented an algorithm with considerable performance to tackle this problem and the code is available in \href{https://www.researchgate.net/publication/393362858_Generalized_ODE_reduction_algorithm}{Researchgate}.

Cite

@article{arxiv.2508.09754,
  title  = {Generalized ODE reduction algorithm with bounded degree transformation},
  author = {Shaoxuan Huang},
  journal= {arXiv preprint arXiv:2508.09754},
  year   = {2025}
}
R2 v1 2026-07-01T04:48:02.945Z