arxiv: 2605.10591 · v1 · submitted 2026-05-11 · 🧮 math.CA

Recognition: 1 theorem link

· Lean Theorem

On the rational solutions of generalized Abel equations

I. Ojeda, L.A. Calderon

Pith reviewed 2026-05-12 05:27 UTC · model grok-4.3

classification 🧮 math.CA

keywords rational solutionsAbel differential equationsNewton-Puiseux polygonfirst-order ODEpolynomial coefficientsbounds on solutionsreal and complex fields

0 comments

The pith

Every nonconstant rational solution to the generalized Abel equation must be the reciprocal of a polynomial, with their total number bounded explicitly by the Newton-Puiseux polygon at infinity.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines nonconstant rational solutions to the first-order differential equation x prime equals A3 of t times x to the n3 plus A2 of t times x to the n2 plus A1 of t times x to the n1, where the exponents satisfy 1 less than n1 less than n2 less than n3 and the A_i are polynomials with real or complex coefficients. It proves that any such solution has the form one over a polynomial p of t. The Newton-Puiseux polygon at infinity is then used to limit the possible degrees of that polynomial. Under a nondegeneracy condition on the coefficients, the edge polynomials of the polygon supply concrete upper bounds on the total number of solutions: at most n2 minus one plus two times n3 minus one over the complex numbers, and at most 12 over the reals, with parity refinements in the real case. This classification and counting result lets one determine all rational solutions for equations of this type without integrating the equation explicitly.

Core claim

The authors prove that every nonconstant rational solution x of the equation takes the form x equals 1 over p of t for some polynomial p. They apply the Newton-Puiseux polygon at infinity to this ansatz to restrict the admissible degrees of p. When the coefficients A_i satisfy a nondegeneracy hypothesis, the associated edge polynomials produce explicit upper bounds on the total number S of rational solutions: S is at most (n2 minus 1) plus 2 times (n3 minus 1) over the complex numbers, while over the reals S is at most 12, together with sharper estimates that depend on the parity of the exponents.

What carries the argument

The Newton-Puiseux polygon at infinity constructed from the ansatz x equals 1 over p of t, whose edges and associated edge polynomials restrict degrees and bound the number of solutions.

If this is right

The possible degrees of the denominator polynomial p are restricted by the geometry of the Newton-Puiseux polygon at infinity.
Over the complex numbers the total number of nonconstant rational solutions cannot exceed (n2 minus 1) plus 2 times (n3 minus 1).
Over the real numbers the total number is at most 12, and the bound can be sharpened further according to the parity of the exponents n1, n2, n3.
The nondegeneracy condition on the A_i is what permits the edge polynomials to convert the polygon geometry into concrete numerical bounds.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same polygon technique at infinity could be adapted to bound rational solutions of other first-order polynomial differential equations that admit a reciprocal ansatz.
For concrete coefficients the method supplies a finite list of candidate degrees for p, after which one can solve linear systems to check which candidates actually work.
When the nondegeneracy condition fails, the number of solutions may still be finite but the explicit bounds derived from the edge polynomials no longer apply.
The real-case bound of 12 suggests that exhaustive enumeration of rational solutions becomes feasible for small exponents even by hand or low-degree computer search.

Load-bearing premise

The coefficients A_i must obey a nondegeneracy hypothesis for the edge polynomials to deliver the stated upper bounds on the number of solutions.

What would settle it

An explicit set of polynomials A1, A2, A3 satisfying the nondegeneracy condition together with either a rational solution whose denominator has a degree forbidden by the Newton-Puiseux polygon or a total of more than (n2 minus 1) plus 2 times (n3 minus 1) distinct nonconstant rational solutions over the complex numbers.

read the original abstract

We study nonconstant rational solutions of \[ x'=A_3(t)x^{n_3}+A_2(t)x^{n_2}+A_1(t)x^{n_1}, \qquad 1<n_1<n_2<n_3, \] with $A_i\in\Bbbk[t]$, $\Bbbk\in\{\mathbb R,\mathbb C\}$. We prove that every such solution is of the form $x=1/p(t)$, and use the Newton--Puiseux polygon at infinity to restrict the possible degrees of $p$. Under a nondegeneracy hypothesis, the associated edge polynomials yield explicit bounds for the total number $\mathcal S$ of rational solutions. In particular, $\mathcal S\le (n_2-1)+2(n_3-1)$ over $\mathbb C$, while over $\mathbb R$ one has $\mathcal S\le 12$, with sharper parity-dependent estimates in the real case.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper shows rational solutions to the given Abel-type ODE must be reciprocal polynomials and uses Newton-Puiseux at infinity to derive explicit bounds on their number under a nondegeneracy condition.

read the letter

The main takeaway is that every nonconstant rational solution takes the form x = 1/p(t) for a polynomial p, after which the Newton-Puiseux polygon at infinity restricts the possible degrees of p and, under nondegeneracy on the A_i, produces concrete upper bounds on the total count S: (n2-1) + 2(n3-1) over C and S ≤ 12 over R, with some parity sharpening in the real case. That combination of the reciprocal reduction plus the polygon for numerical bounds is the fresh part; prior Abel work is referenced but these explicit counts and the precise form statement do not appear in the cited results. The logic is internally consistent and the tools are standard for algebraic differential equations, which keeps the argument readable and direct. The nondegeneracy hypothesis is stated clearly as a prerequisite, so there is no hidden assumption. The real-complex split and the parity estimates add some practical detail. The main limitation is that the bounds apply only when the coefficients satisfy the nondegeneracy condition; degenerate cases are left aside and might admit more solutions or require different analysis. It would also be useful to see whether the paper supplies examples attaining the bounds or discusses how restrictive the hypothesis is in practice. This is aimed at people working on rational solutions of nonlinear first-order ODEs or algebraic differential equations more broadly. A reader who wants computable restrictions on solution counts for concrete families will find the explicit numbers helpful. The paper engages the literature honestly and the central steps hold up, so it deserves a serious referee. I would send it out for peer review.

Referee Report

1 major / 3 minor

Summary. The paper studies nonconstant rational solutions of the generalized Abel equation x' = A_3(t)x^{n_3} + A_2(t)x^{n_2} + A_1(t)x^{n_1} (1 < n_1 < n_2 < n_3, A_i polynomials over R or C). It proves every such solution has the form x = 1/p(t) for a polynomial p, applies the Newton-Puiseux polygon at infinity to bound possible degrees of p, and under a stated nondegeneracy hypothesis on the A_i uses the associated edge polynomials to obtain explicit upper bounds on the total number S of rational solutions: S ≤ (n_2-1) + 2(n_3-1) over C, while S ≤ 12 over R together with sharper parity-dependent estimates.

Significance. If the derivations hold, the work supplies concrete, explicit finiteness bounds on rational solutions for a natural three-term family of first-order algebraic differential equations. The reduction to reciprocal polynomial form followed by Newton-Puiseux analysis at infinity is a standard and appropriate technique that here yields usable numerical estimates (especially the uniform real bound of 12), which may be of interest in the qualitative theory of ODEs and in questions of algebraic integrability. The conditional character of the bounds is clearly flagged, avoiding overstatement.

major comments (1)

[Section introducing Newton-Puiseux polygon at infinity] The nondegeneracy hypothesis on the coefficients A_i is load-bearing for the edge-polynomial bounds in the abstract; its precise algebraic formulation (e.g., non-vanishing of certain resultants or leading coefficients on the relevant edges) should be stated explicitly in the section introducing the polygon analysis so that the reader can verify when the stated inequalities apply.

minor comments (3)

[Abstract] The abstract states the real bound S ≤ 12 without indicating the range of n_i for which it holds or whether the parity refinements depend on the parities of n_2 and n_3; this should be clarified in the introduction or the statement of the main theorem.
Notation for the field k (written as Bbbk) and for the total count S is introduced in the abstract but should be repeated with a short definition at the beginning of the main text for self-contained reading.
[Introduction] A brief comparison with known bounds for the classical Abel equation (n_3=3, n_2=2) would help situate the new estimates; if such a comparison is already present, ensure it is referenced in the introduction.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and the constructive comment. We agree that the nondegeneracy hypothesis requires a more explicit formulation in the indicated section and will revise accordingly.

read point-by-point responses

Referee: [Section introducing Newton-Puiseux polygon at infinity] The nondegeneracy hypothesis on the coefficients A_i is load-bearing for the edge-polynomial bounds in the abstract; its precise algebraic formulation (e.g., non-vanishing of certain resultants or leading coefficients on the relevant edges) should be stated explicitly in the section introducing the polygon analysis so that the reader can verify when the stated inequalities apply.

Authors: We agree with the referee that the nondegeneracy hypothesis is essential for the edge-polynomial bounds and that its precise algebraic conditions should be stated explicitly in the section on the Newton-Puiseux polygon at infinity. In the revised manuscript we will insert a dedicated paragraph at the start of that section giving the exact formulation: the relevant leading coefficients of the A_i must be nonzero, and the resultants of the associated edge polynomials (with respect to the Newton polygon at infinity) must be nonzero. This will make the applicability of the bounds S ≤ (n₂-1) + 2(n₃-1) over ℂ and the real bounds fully verifiable by the reader. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the derivation chain

full rationale

The paper's central results follow from a direct algebraic analysis of rational solutions to the given first-order ODE. It first establishes that any nonconstant rational solution must take the form x=1/p(t) by substituting a general rational ansatz into the equation and examining pole orders or clearing denominators, which is a standard reduction for rational solutions of algebraic DEs and does not presuppose the final count S. The Newton-Puiseux polygon is then constructed at infinity on the transformed equation to bound possible degrees of p via the geometry of the support; this is an external combinatorial tool whose output depends only on the input exponents n_i and the degrees of the coefficient polynomials A_i. Under the explicitly stated nondegeneracy hypothesis on the A_i, the edge polynomials of that polygon yield the stated upper bounds on S. None of these steps reduces a claimed prediction to a fitted parameter, a self-definition, or a load-bearing self-citation; the logic is self-contained against the external Newton-polygon machinery and the nondegeneracy assumption is presented as a prerequisite rather than smuggled in.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The argument rests on the standard Newton-Puiseux theorem for Puiseux series expansions at infinity and on the algebraic properties of polynomials over R or C; the only non-standard assumption is the nondegeneracy hypothesis needed to guarantee that the edge polynomials give the stated bounds.

axioms (2)

standard math Newton-Puiseux theorem applies to the characteristic polynomial at infinity after the substitution x=1/p
Invoked to restrict possible degrees of p(t).
domain assumption The coefficients A_i belong to k[t] with k = R or C
Stated in the setup of the differential equation.

pith-pipeline@v0.9.0 · 5459 in / 1390 out tokens · 92929 ms · 2026-05-12T05:27:47.370257+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear
We prove that every such solution is of the form x=1/p(t), and use the Newton–Puiseux polygon at infinity to restrict the possible degrees of p. Under a nondegeneracy hypothesis, the associated edge polynomials yield explicit bounds...

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

[1]

D. M. Benardete, V. W. Noonburg and B. Pollina,Qualitative tools for studying periodic solutions and bifurcations as applied to the periodically harvested logistic equation, Amer. Math. Monthly115(3) (2008), 202–219. DOI:https://doi.org/10.1080/00029890.2008.11920518

work page doi:10.1080/00029890.2008.11920518 2008
[2]

J. L. Bravo, L. A. Calder´ on and M. Fern´ andez,Upper bounds of limit cycles in Abel differential equations with invariant curves, Journal of Mathematical Analysis and Applications494(2021), 124580. DOI:https: //doi.org/10.1016/j.jmaa.2020.124580

work page doi:10.1016/j.jmaa.2020.124580 2021
[3]

J. L. Bravo, L. A. Calder´ on, M. Fern´ andez and I. Ojeda,Rational solutions of Abel differential equations, Journal of Mathematical Analysis and Applications515(1) (2022), 126368. DOI:https://doi.org/10. 1016/j.jmaa.2022.126368

work page arXiv 2022
[4]

J. L. Bravo, L. A. Calder´ on and I. Ojeda,Rational limit cycles of Abel differential equations, Electronic Journal of Qualitative Theory of Differential Equations47(2023), 1–13. DOI:https://doi.org/10. 14232/ejqtde.2023.1.47

work page 2023
[5]

Briskin, J

M. Briskin, J. P. Fran¸ coise and Y. Yomdin,Center conditions, compositions of polynomials and moments on algebraic curves, Ergodic Theory Dynam. Systems19(5) (1999), 1201–1220. DOI:https://doi.org/ 10.1017/S0143385799141737

work page doi:10.1017/s0143385799141737 1999
[6]

Briskin, J

M. Briskin, J. P. Fran¸ coise and Y. Yomdin,Center conditions II: Parametric and model center problems, Israel J. Math.118(2000), 61–82. DOI:https://doi.org/10.1007/BF02803516

work page doi:10.1007/bf02803516 2000
[7]

L. ´A. Calder´ on,Rational solutions and limit cycles of polynomial and trigonometric Abel equations, Electronic Journal of Qualitative Theory of Differential Equations2025(18) (2025), 1–16. DOI:https: //doi.org/10.14232/ejqtde.2025.1.18

work page doi:10.14232/ejqtde.2025.1.18 2025
[8]

Cano,An extension of the Newton–Puiseux polygon construction to give solutions of Pfaffian forms, Annales de l’Institut Fourier43(1) (1993), 125–142

J. Cano,An extension of the Newton–Puiseux polygon construction to give solutions of Pfaffian forms, Annales de l’Institut Fourier43(1) (1993), 125–142. DOI:https://doi.org/10.5802/aif.1324

work page doi:10.5802/aif.1324 1993
[9]

Cano,The Newton Polygon Method for Differential Equations, In: H

J. Cano,The Newton Polygon Method for Differential Equations, In: H. Li, P. J. Olver, G. Sommer (eds.), Computer Algebra and Geometric Algebra with Applications, Lecture Notes in Computer Science, vol. 3519, Springer, Berlin–Heidelberg, 2005, pp. 18–30. DOI:https://doi.org/10.1007/11499251_3

work page doi:10.1007/11499251_3 2005
[10]

A. Cima, A. Gasull and F. Ma˜ nosas,On the number of polynomial solutions of Bernoulli and Abel polynomial differential equations, J. Differential Equations263(11) (2017), 7099–7122. DOI:https: //doi.org/10.1016/j.jde.2017.08.003

work page doi:10.1016/j.jde.2017.08.003 2017
[11]

M. V. Demina,Necessary and sufficient conditions for the existence of invariant algebraic curves, Electronic Journal of Qualitative Theory of Differential Equations2021(48) (2021), 1–22. DOI:https://doi.org/ 10.14232/ejqtde.2021.1.48

work page doi:10.14232/ejqtde.2021.1.48 2021
[12]

M. V. Demina,The method of Puiseux series and invariant algebraic curves, Communications in Contem- porary Mathematics24(3) (2022), 2150007. DOI:https://doi.org/10.1142/S0219199721500073

work page doi:10.1142/s0219199721500073 2022
[13]

Du and Y

J. Du and Y. Zhao,Rational Solutions of a Class of Generalized Abel Equations, Qualitative Theory of Dynamical Systems25:24 (2026). DOI:https://doi.org/10.1007/s12346-026-01449-5

work page doi:10.1007/s12346-026-01449-5 2026
[14]

Gasull,Some open problems in low dimensional dynamical systems, SeMA J.78(2021), 233–269

A. Gasull,Some open problems in low dimensional dynamical systems, SeMA J.78(2021), 233–269. DOI: https://doi.org/10.1007/s40324-021-00244-3

work page doi:10.1007/s40324-021-00244-3 2021
[15]

Gasull, J

A. Gasull, J. Torregrosa and X. Zhang,The number of polynomial solutions of polynomial Riccati equations, J. Differential Equations261(9) (2016), 5071–5093. DOI:https://doi.org/10.1016/j.jde.2016.07. 019

work page doi:10.1016/j.jde.2016.07 2016
[16]

J. Gine, M. Grau and J. Llibre,On the polynomial limit cycles of polynomial differential equations, Israel J. Math.106(2013), 481–507

work page 2013
[17]

Huang, H

J. Huang, H. Liang and J. Llibre,Non-existence and uniqueness of limit cycles for planar polynomial differential systems with homogeneous nonlinearities, Journal of Differential Equations265(2018), 3888–

work page 2018
[18]

ON THE RATIONAL SOLUTIONS OF GENERALIZED ABEL EQUATIONS 21

DOI:https://doi.org/10.1016/j.jde.2018.05.003. ON THE RATIONAL SOLUTIONS OF GENERALIZED ABEL EQUATIONS 21

work page doi:10.1016/j.jde.2018.05.003 2018
[19]

C. Liu, C. Li, X. Wang and J. Wu,On the rational limit cycles of Abel equations, Chaos Solitons Fractals 110(2018), 2–32. DOI:https://doi.org/10.1016/j.chaos.2018.03.004

work page doi:10.1016/j.chaos.2018.03.004 2018
[20]

Llibre and C

J. Llibre and C. Valls,Polynomial Solutions of Equivariant Polynomial Abel Differential Equations, Adv. Nonlinear Stud.18(3) (2018), 537–542. DOI:https://doi.org/10.1515/ans-2017-6043

work page doi:10.1515/ans-2017-6043 2018
[21]

Llibre and C

J. Llibre and C. Valls,Rational limit cycles of Abel equations, Commun. Pure Appl. Anal.20(3) (2021), 1077–1089

work page 2021
[22]

X. Qian, Y. Shen and J. Yang,The number of rational solutions of Abel equations, Journal of Applied Analysis & Computation11(5) (2021), 2535–2552. DOI:https://doi.org/10.11948/20200475

work page doi:10.11948/20200475 2021
[23]

Smale,Mathematical problems for the next century, Math

S. Smale,Mathematical problems for the next century, Math. Intelligencer20(1998), 7–15

work page 1998
[24]

Valls,Rational solutions of Abel trigonometric polynomial differential equations, Journal of Geometry and Physics180(2022)

C. Valls,Rational solutions of Abel trigonometric polynomial differential equations, Journal of Geometry and Physics180(2022)

work page 2022
[25]

R. J. Walker,Algebraic Curves, Princeton Mathematical Series, no. 13, Princeton University Press, Prince- ton, 1950

work page 1950
[26]

Zeng and Y

H. Zeng and Y. Zhao,An Upper Bound for the Number of Rational Solutions of Generalized Abel Equations, Qualitative Theory of Dynamical Systems25(2026), 95. DOI:https://doi.org/10.1007/ s12346-026-01509-w. Departamento de Matematicas, Universidad Castilla-La Mancha, 13071 Ciudad Real, Spain Email address:luisangel.calderon@uclm.es Departamento de Matematic...

work page 2026