{"id":"5ec48425-de07-4abe-abda-a49298df304d","arxiv_id":"2505.24370","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":7,"one_line_summary":"A class of two-dimensional cubic rational ODE systems is explicitly solvable, and sometimes isochronous, when its 23 coefficients satisfy 12 explicit constraints.","lead":"This paper identifies a family of two coupled nonlinear equations whose solutions can be written down explicitly, provided the equations' coefficients satisfy certain constraints. It gives exact formulas and examples, including cases where all solutions are periodic with the same period.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The 12-constraint sufficiency claim rests on unverified elimination algebra and omits the C2=0 with h1,h2≠0 parameter regime; this should be checked before the conditional verdict is upgraded.","rationale":"The construction in the paper is coherent and the five worked examples give real supporting evidence. I have no objection to the overall strategy: a quadratic-plus-linear transformation to a linear system is a legitimate route to explicit solvability, and the paper is honest about the branch and singularity issues in Remark 2.2-1. My stress test is therefore not a conceptual rejection but a verification concern. The single most load-bearing step is the claim that the 12 constraints in Section 2.4 are sufficient for the coefficients to lie in the 15-parameter family (9). The paper explicitly says the elimination was done with Mathematica, but it does not show the derivation and provides no symbolic verification artifact. Moreover, the inversion is not complete: the C2=0 regime with h1,h2≠0 is neither covered by the formulas of Section 2.4.1 nor by the special case h1=h2=0 of Section 2.4.3, and the text does not state that such coefficients are excluded. Since equations (17)-(18) and (25) contain many denominators and repeated substitutions, the risk of a typo or a missing constraint is non-negligible. The reader's verdict of CONDITIONAL with moderate confidence is exactly right; my concern does not move the verdict, but it identifies the precise computation that should be done before upgrading. The concrete test above is designed to settle the issue: exact symbolic verification of both the forward substitution and the backward elimination in all admissible regimes, including the missing degenerate C2=0 case.","tokens_in":24779,"tokens_out":17660,"duration_ms":233060,"concrete_test":"Use an exact-computation computer algebra system, e.g., SymPy with rational arithmetic, to perform this check. (1) Generate random rational parameter sets in three regimes: (a) generic with C2≠0; (b) C2=0 with h1,h2≠0, e.g., α0=1, α1=2, α2=1, λ1=0, λ2=1; (c) h1=h2=0. For each, compute f_k, g_k, h_l via equations (9), solve the linear system (2) for y(t), and substitute the corresponding inverse map (7) or (8) into the original ODEs (1) to verify the identity exactly. (2) For the same parameter sets, evaluate the residuals of the 12 displayed constraints (17)-(18), or (25) in case (c), and check that they vanish identically. (3) In case (b), attempt to find an alternative parameter inversion with 4α0α2−(α1)^2≠0. If the constraints vanish but no such inversion is found, the sufficiency statement needs an additional subcase; if any residual fails, the displayed constraints are incorrect.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central theorem claims that system (1) is explicitly solvable whenever the 23 coefficients satisfy the 12 constraints of Section 2.4, equivalently are produced by formulas (9) from 15 parameters. The proof has two load-bearing steps: (i) direct substitution showing that (2) plus the ansatz (6) implies (1) when the coefficients are given by (9), and (ii) inversion showing that the 12 constraints are sufficient to recover such parameters. Step (i) is routine but is not shown and is not machine-checked; step (ii) is the actual weak point. The displayed inversion in Section 2.4.1 assumes h1≠0 and h2≠0 and divides by g8, g9, g6, 9g6g9h1 − (g8)^2 h2, and similar factors; Section 2.4.3 handles h1=h2=0. Between these cases lies the admissible regime C2=0 with h1,h2≠0, for example α0=1, α1=2, α2=1, λ1=0, λ2=1 gives h1=h2=2 and C2=0. In this regime the inversion (7) is replaced by (8), but no inversion formulas are supplied and the text does not say such coefficient sets are covered. The paper itself flags the branch and singularity issue in Remark 2.2-1, so the main unresolved risk is not the existence of singularities but whether the 12 constraints indeed characterize, even generically, the image of (9). Because the elimination is only asserted via Mathematica with no notebook, derivation, or trace, a single algebraic error in equations (17)-(18) or (25) would invalidate the sufficiency claim for an open set of coefficients.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the planar system (1) of two first-order ODEs with cubic numerators and a common linear denominator, containing 23 coefficients. The authors introduce a quadratic-linear ansatz (6) relating the variables x_n to variables y_n that evolve according to the linear system (2). Substitution yields 23 explicit formulas (9) expressing the coefficients of (1) in terms of 15 parameters, and hence explicit solutions via (3) and (7)–(8). The paper then claims to invert these formulas and obtains 12 explicit constraints—eqs. (17)–(18), (19), and (25) in the three subcases of Section 2.4—that are asserted to be sufficient for the system to belong to the explicitly solvable class. It also identifies conditions (4) that imply isochrony, and presents five worked examples illustrating periodic, singular, and hyperbolic behaviors. Throughout, the manuscript is candid about possible loss of determinacy when the square-root S(t) in (7c) vanishes, but the formal claims in the abstract and Section 4 are stated without such qualifications.","tokens_in":25232,"tokens_out":7148,"duration_ms":92546,"significance":"If the elimination algebra is correct, the result is a useful and interesting contribution to the literature on explicitly solvable and isochronous planar polynomial/rational ODE systems, in the spirit of earlier work by Calogero and collaborators. The constructive ansatz is transparent, the explicit solution formulas are valuable, and the examples in Section 3 provide concrete illustrations of the different qualitative regimes. The paper does not ship machine-checked proofs or a verification artifact, which is a real limitation because the central sufficiency claim rests on lengthy asserted elimination steps. The branch-choice and finite-time-singularity caveats are acknowledged in Remark 2.2-1, but they are not integrated into a precise theorem, so the phrase 'arbitrary initial data' in the abstract overstates what is actually proved.","major_comments":[{"comment":"The inversion in Section 2.4.1 uses the transformation (7), which is only valid when C2 ≠ 0, but the case C2 = 0 with h1 and h2 both nonzero is not treated. This is not merely hypothetical: for α0 = 1, α1 = 3, α2 = 2, λ1 = λ2 = 1, one obtains h1 = h2 = −1 while C2 = 0. In this regime the transformation must be replaced by (8), yet no inversion formulas are supplied and the text does not state that such coefficient sets are excluded. Since the paper claims that the 12 constraints are sufficient whenever they hold (with nonvanishing denominators), the proof is incomplete for an open subset of the image of (9). Please add this case explicitly or restrict the sufficiency statement to C2 ≠ 0, and check whether the constraints themselves force C2 ≠ 0.","section":"§2.4.1, eqs. (13)–(18) and eq. (7)"},{"comment":"The abstract and Remark 1-1 promise that the initial-value problem can be explicitly solved 'with arbitrary initial data', but the construction requires a choice of branch in (7a), continuation past values where S(t) in (7c) vanishes, and nonvanishing of the denominators appearing in the inversion formulas. Remark 2.2-1 concedes that solutions may cease to be determined at a finite time tS when S(tS) = 0. The paper never delimits the set of initial data for which the explicit formula defines a genuine solution on a maximal interval, nor does it state the branch-selection rule as part of a formal theorem. This ambiguity affects the central claim and should be resolved by stating a precise theorem with the maximal interval, the branch rule, and the admissible initial data.","section":"Abstract, Remark 1-1, and Remark 2.2-1"},{"comment":"The derivation of the 12 constraints is described as 'trivial if tedious algebra' performed with Mathematica, but no derivation, intermediate algebraic system, or machine-readable verification is included. Because the sufficiency claim is the main result and the formulas are long, I could not independently verify from the text that eqs. (17)–(18) are exactly the elimination conditions, and a single algebraic error there would invalidate the theorem. Please provide a reproducible computation—for example, a short Mathematica or SymPy script that checks both the substitution of (9) into (1) and the elimination leading to (17)–(18)—or list the reduced intermediate equations, and explicitly state all denominator conditions such as g6 ≠ 0, g8 ≠ 0, g9 ≠ 0, h1 ≠ 0, h2 ≠ 0, g8h1 − 3g9h2 ≠ 0, and 9g6g9h1 − (g8)^2 h2 ≠ 0.","section":"§2.4, eqs. (17)–(18), (19), (25)"}],"minor_comments":[{"comment":"The displayed expression for y1(0) contains an apparent typo: the term '−3 [x2(0)]^2' appears twice, likely intended to be '−3 x2(0)'.","section":"§3.2, eq. (49a)"},{"comment":"In eq. (55b) the second equilibrium point is labeled with X(+)_2 instead of X(−)_2, and in eq. (63a) both equilibria are labeled with the superscript (+); the second should be (−).","section":"§3.3, eq. (55b) and §3.4, eq. (63a)"},{"comment":"The symbol λ is used both as a parameter in eqs. (6) and (9) and as the norm λ = sqrt(λ1^2 + λ2^2) in eq. (27); please use a different symbol for the norm to avoid confusion.","section":"§2.5, eq. (27)"},{"comment":"There are numerous typographical errors, including 'isochonous', 'equilibra', 'sy stem', and 'ODES'; a careful copyedit is recommended.","section":"Throughout"},{"comment":"Several displayed solutions, such as eqs. (48a), (72a), and (74a), are extremely long and contain unbalanced parentheses in places (e.g., eq. (48a)); moving the full expressions to an appendix or providing a supplementary computation file would improve readability and checkability.","section":"§3.1–3.5"}],"recommendation":"major_revision","confidential_remarks":"The paper fits the scope of nlin.SI and the underlying construction appears promising, but the main sufficiency result is not fully established in the written manuscript because of the omitted C2 = 0 case and the absence of any reproducible verification of the elimination algebra. In my view the authors should be asked to supply a machine-checked derivation or a detailed appendix before the claim is accepted."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Calogero and coauthors extend their earlier homogeneous cubic case to non-homogeneous cubics with a common linear denominator. The core idea is simple and sound: use the quadratic-in-x1,x2 to linear y1 and linear to y2 ansatz, solve the auxiliary linear system, and invert. The forward direction – coefficients given by the 15-parameter formulas (9) imply explicit solvability – is directly verifiable by substitution, and the five worked examples give real evidence. The isochrony condition (4) is a nice bonus. This is a legitimate generalization, not a paradigm shift.\n\nThe soft spot is the reverse direction: the claim that the 12 explicit constraints (17)-(18) or (25) are sufficient to guarantee membership in the solvable class. The paper says this follows from Mathematica elimination, but no notebook or derivation is shipped, and several intermediate formulas are explicitly omitted as 'too long'. The displayed inversion divides by quantities like g8, g9, g6, and 9g6g9h1 - (g8)^2 h2, so the generic case is fine but degeneracies are not mapped. In particular, the regime C2=0 with h1,h2≠0 exists (for instance α1=0, α0=1, α2=-1, λ1=λ2=1 gives h1=h2=2 and C2=0), and the paper does not explain how the 12 constraints are sufficient there or whether the inversion needs modification. This is a genuine gap in the proof as written, though it is likely patchable: the forward construction via (8) works whenever the parameters exist, so one would just need a case analysis showing the constraints imply such parameters.\n\nThe paper is honest about the branch/singularity issue in Remark 2.2-1, and the examples are consistent. The citation pattern is mostly self-referential within Calogero's programme, which is appropriate here. The main unresolved risk is algebraic: a single sign error in (17)-(18) or (25) would invalidate the sufficiency claim for an open set of coefficients. Given that no verification artifact is provided, a referee should ask for either a Mathematica notebook or a more detailed derivation before accepting the sufficiency claim at face value.\n\nWho is this for: researchers working on exactly solvable nonlinear ODEs, especially isochronous systems. They will find the explicit formulas and examples useful. The paper deserves peer review – the construction is interesting and the gap is fixable – but it should not be accepted without the verification. I'd recommend sending it to a competent referee, with a request to check the elimination algebra.","headline":"A genuine but incremental extension of a known linearization trick; the forward construction is solid, the sufficiency of the 12 constraints needs external verification.","tokens_in":25807,"tokens_out":4567,"would_cite":false,"duration_ms":50378,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["34A05","34A34","34C25"],"pacs":[],"model":"deepseek-v4-flash","headline":"A system of two coupled ODEs with 23 coefficients is explicitly solvable when 12 coefficient constraints hold, and becomes isochronous under two further conditions.","keywords":["explicitly solvable ODEs","isochronous systems","rational vector fields","cubic polynomials","nonlinear change of variables","coefficient constraints","periodic solutions","two-dimensional autonomous systems"],"falsifier":"A reader can settle the claim by picking a concrete instance of the class, for instance the isochronous Example 2 with initial data $x_1(0)=1$, $x_2(0)=0.2$; the explicit formula gives a real trajectory only up to the time $t_S$ when $x_1(t)=0$, so a numerical integration of the original ODEs that continued smoothly past that time would show the formula misses a branch. Conversely, substituting the formulas (7) and (3) into (1) by computer algebra for generic parameters would expose any algebraic error in the coefficient formulas (9).","tokens_in":24540,"feed_emoji":"📐","tokens_out":8151,"duration_ms":97073,"temperature":0.7,"pith_summary":"The paper studies a two-dimensional autonomous system of ordinary differential equations in which each derivative is a ratio of a cubic polynomial over a common linear polynomial, so the right-hand side carries 23 free coefficients. It establishes that if those coefficients satisfy 12 explicit constraints, equivalently if they are produced by 23 formulas from 15 free parameters, the initial-value problem can be solved in closed form. The solution is obtained by a nonlinear change of variables that sends the nonlinear system to a two-dimensional linear system with constant coefficients. When the linear system's coefficients satisfy two additional restrictions, every nonsingular solution is periodic with one common period, so the original system is isochronous. The paper also gives concrete examples, including the polynomial case with no denominator, illustrating periodic, singular, and asymptotically escaping trajectories.","feed_headline":"Two cubic-over-linear ODEs solved exactly under 12 constraints","feed_subtitle":"A change of variables sends the nonlinear pair to linear equations, giving closed-form and sometimes periodic solutions.","key_machinery":"The load-bearing device is the polynomial substitution (6) together with the linear system (2). The substitution is deliberately chosen so that differentiating $y$ along (1) yields expressions that collapse to linear functions of $y$ when the coefficients obey (9). The inverse formulas (7)--(8) invert the map through a square root, and the discriminant $S(t)$ controls the singularity line. The 12 constraints (17)--(18), and their versions in the special cases, are obtained by eliminating the 15 auxiliary parameters from the 23 formulas (9), and they certify that a given system belongs to the explicitly solvable class.","core_discovery":"The central discovery is that the class of systems (1) with $f_k,g_k,h_\\ell$ given by the explicit formulas (9) in terms of the 15 parameters $\\eta_{nm},\\xi_n,\\alpha_\\ell,\\beta_n,\\gamma,\\lambda_n,\\mu$ is exactly solvable: the polynomial map (6), $y_1=\\alpha_0x_1^2+\\alpha_1x_1x_2+\\alpha_2x_2^2+\\beta_1x_1+\\beta_2x_2+\\gamma$, $y_2=\\lambda_1x_1+\\lambda_2x_2+\\mu$, transforms the nonlinear equations (1) into the linear system (2), whose solution is the explicit exponential formula (3). The inverse map (7)--(8) then gives $x_1(t),x_2(t)$ explicitly, up to a square root whose sign is fixed by the initial data and whose vanishing marks the only obstruction to continued uniqueness. Inverting the coefficient formulas produces 12 constraints on the 23 coefficients, leaving 11 coefficients freely assignable; when in addition $\\eta_{22}=-\\eta_{11}$ and $(\\eta_{11})^2+\\eta_{12}\\eta_{21}=-\\omega^2<0$, all nonsingular solutions are periodic with common period $T=2\\pi/\\omega$.","pith_inferences":["This suggests the same linearization mechanism is likely to work for higher-degree numerators or more variables: any polynomial map from $x$ to $y$ that linearizes the flow imposes matching conditions on the coefficients, and the 12-constraint structure is one instance of that matching.","The constraints are shown to be sufficient, not necessary; a natural question is whether a wider set of solvable systems exists whose coefficients do not satisfy (17)--(18), which would amount to finding a different linearizing map.","The explicit formulas provide a cheap laboratory for singularity studies: one can choose the linear system to be periodic and the parameters so that the image trajectory hits $P_1=0$, yielding computable values of $t_S$ and a test case for numerical methods for rational vector fields with movable singularities.","Because the period $T$ is set by $\\omega$ alone, the class can be used to design two-dimensional ODE models with a prescribed common oscillation frequency, which may be useful when synchronized periodic outputs are observed."],"forward_implications":["Any system whose coefficients satisfy the 12 constraints has explicit solution formulas, so its solutions can be written without numerical integration, and the formulas contain all dependence on initial data.","When the two conditions (4) hold, every solution that stays nonsingular for all time is periodic with the same period $2\\pi/\\omega$; the paper's examples show that some trajectories instead terminate at the singularity line before one period.","The polynomial subcase $P_1\\equiv 1$ yields explicitly solvable systems of two coupled cubic ODEs, including non-homogeneous cubics not covered by the previous homogeneous treatment.","The class contains systems with stable, unstable, and neutral equilibria, as well as systems with no real equilibria; the equilibrium type is inherited from the associated linear system because the map (6) sends the linear equilibrium to the two preimages (33).","The transformation reduces the number of independent coefficients: a linear change of variables puts the system in a form with 19 coefficients satisfying 8 constraints, with one equation becoming purely polynomial."],"supporting_citations":[{"why":"Supplies the classical technique for constructing solvable nonlinear systems via requiring the general integral to be uniform, whose variant underlies the treatment of the homogeneous cubic subcase.","marker":"[1]"},{"why":"Defines the isochrony notion and the standard period theory the paper invokes for the periodically oscillating subclass.","marker":"[5]"},{"why":"Earlier explicit treatment of the homogeneous polynomial subcase, which the polynomial subcase of the present paper extends.","marker":"[7]"}],"fun_headline_variants":["Nonlinear ODE pair linearized by polynomial map under constraints","Exact closed forms for cubic-over-linear ODE systems with 12 constraints","Solvable nonlinear ODE pair via quadratic map to linear equations","Isochronous solutions for nonlinear ODEs with restricted coefficients","Cubic ODE pair solved exactly when coefficients satisfy 12 formulas"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction assumes the map (6) can be inverted on the whole time interval where the formula is used: in the generic case $C_2\\neq 0$, or $C_1(t)\\neq 0$ when $C_2=0$, and the chosen square-root branch must not cross $S(t)=0$; the paper leaves open exactly which initial data meet these conditions.","fun_headline_variants_meta":{"raw":{"variants":["Nonlinear ODE pair linearized by polynomial map under constraints","Exact closed forms for cubic-over-linear ODE systems with 12 constraints","Solvable nonlinear ODE pair via quadratic map to linear equations","Isochronous solutions for nonlinear ODEs with restricted coefficients","Cubic ODE pair solved exactly when coefficients satisfy 12 formulas"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001145,"raw_usage":{"total_tokens":4859,"prompt_tokens":1166,"completion_tokens":3693,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":782,"completion_tokens_details":{"reasoning_tokens":3602}},"tokens_in":782,"tokens_out":3693,"duration_ms":32361,"temperature":1.0,"reasoning_tokens":3602,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T12:24:33.004507+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A reader can settle the claim by picking a concrete instance of the class, for instance the isochronous Example 2 with initial data $x_1(0)=1$, $x_2(0)=0.2$; the explicit formula gives a real trajectory only up to the time $t_S$ when $x_1(t)=0$, so a numerical integration of the original ODEs that continued smoothly past that time would show the formula misses a branch. Conversely, substituting the formulas (7) and (3) into (1) by computer algebra for generic parameters would expose any algebraic error in the coefficient formulas (9).","supporting_citations":[{"cited_title":"Garnier, Sur des syst` emes diff´ erentielles du second ordre dont l’ int´ egral g´ en´ eral est uniforme, Annales scientifiques de l’ ´E","cited_arxiv_id":null,"evidence_quote":"Supplies the classical technique for constructing solvable nonlinear systems via requiring the general integral to be uniform, whose variant underlies the treatment of the homogeneous cubic subcase."},{"cited_title":"Calogero, Isochronous Systems , Oxford University Press, 2008 (hardback version), 2012 (updated paperback version)","cited_arxiv_id":null,"evidence_quote":"Defines the isochrony notion and the standard period theory the paper invokes for the periodically oscillating subclass."},{"cited_title":"Calogero and F","cited_arxiv_id":null,"evidence_quote":"Earlier explicit treatment of the homogeneous polynomial subcase, which the polynomial subcase of the present paper extends."}],"review_version":1}