AIProofWatch
← Archive

OpenAI reports: Uniform bounds for planar polynomial limit cycles

OpenAI claims a finite degree-dependent upper bound for the total number of isolated periodic trajectories of any planar polynomial vector field.

Sources for this record

What was already known

Finiteness for each fixed vector field does not itself give a uniform degree-only bound over all coefficients.

What changed and why it matters

Advances the stated target relative to the recorded baseline.

The AI contribution

OpenAI attributes the manuscript to its internal model; individual human contributions remain unspecified.

Limitations

The reported bound is not effective and does not classify all arrangements of cycles. The family’s quintic Liénard formalization does not verify this general theorem. Preprint. AIProofWatch read the source statement and context; it has not refereed the proof, compiled a formal development, or established community acceptance.

Verification evidence

Evidence labels show what supports the claim. Importance rates its impact if correct.

Author claim

The original source reports this scoped result; AIProofWatch reviewed its statement, not the full proof.

Accessible artifact / proof

A research manuscript or proof artifact is publicly accessible; availability is not independent checking.

Correction and publication history