Uniform finiteness in Hilbert's sixteenth problem
Canonical statement
View source LaTeX
For every integer \(d\ge2\), there is an integer \(H(d)<\infty\) such that every planar polynomial vector field \[ \dot x=P(x,y),\qquad \dot y=Q(x,y),\qquad \max\{\deg P,\deg Q\}\le d, \] having only finitely many limit cycles has at most \(H(d)\) limit cycles. A limit cycle is an isolated periodic orbit.Notes
The second part of Hilbert's sixteenth problem asks whether the number of limit cycles — isolated periodic orbits — of a planar polynomial vector field , can be bounded uniformly in terms of the degree alone: for each there should be a finite valid for every field with . The problem appeared in Hilbert's celebrated 1900 list [Hilbert1902MathematicalProblems].
The non-uniform half of the question, Dulac's problem, is settled: Écalle and Ilyashenko independently proved that each fixed polynomial field has only finitely many limit cycles [Ilyashenko1991FinitenessLimitCycles]. Those proofs, however, yield no bound depending only on , and no value of is known even for . Quantitative progress has instead concentrated on restricted versions, notably the tangential Hilbert sixteenth problem for perturbations of Hamiltonian fields [Yakovenko2001QuantitativeHilbert].
Recently claimed elementary formulas for have been examined and explicitly refuted [BuzziNovaes2024HilbertAttempt]. The problem remains open; a resolution requires finiteness arguments that behave uniformly across the whole degree- family rather than working field by field.
References (4)
- [Hilbert1902MathematicalProblems]
Mathematical problems
Open ↗1902 · misc
- [Ilyashenko1991FinitenessLimitCycles]
Finiteness Theorems for Limit Cycles
1991 · misc
- [Yakovenko2001QuantitativeHilbert]
Quantitative theory of ordinary differential equations and the tangential Hilbert 16th problem
Open ↗2005 · misc
- [BuzziNovaes2024HilbertAttempt]
A note on a recent attempt to solve the second part of Hilbert's 16th Problem
Open ↗2024 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.