differential-equations / Planar polynomial vector fields; limit cycles

The existential Hilbert sixteenth problem: a uniform bound on the number of limit cycles of planar polynomial vector fields

Theorem 1.1: for each d≥1d\ge1 there is a finite integer B(d)B(d) such that every real planar polynomial vector field of degree at most dd has at most B(d)B(d) limit cycles in the whole plane, with no restriction on coefficients, location, stability or hyperbolicity. The proof works with matching systems of local passages and shows that each fixed auxiliary system has finitely many isolated solutions, uniformly as coefficients vary. It does NOT give an explicit or effective B(d)B(d), so it says nothing about the value of H(2)H(2), about Smale's question whether H(d)≤KdqH(d)\le Kd^q, or about the relative positions of cycles asked for in Hilbert's full second part. The exact quintic Lienard bound in the same family is a separate entry.

85Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

differential-equationsSep 24, 2026Significance 85/100Registry: unreviewed

The existential Hilbert sixteenth problem: a uniform bound on the number of limit cycles of planar polynomial vector fields

Prior state unknown→proved

Theorem 1.1: for each d≥1d\ge1 there is a finite integer B(d)B(d) such that every real planar polynomial vector field of degree at most dd has at most B(d)B(d) limit cycles in the whole plane, with no restriction on coefficients, location, stability or hyperbolicity. The proof works with matching systems of local passages and shows that each fixed auxiliary system has finitely many isolated solutions, uniformly as coeff…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: for each d≥1d\ge1 there is a finite integer B(d)B(d) such that every real planar polynomial vector field of degree at most dd has at most B(d)B(d) limit cycles in the whole plane, with no restriction on coefficients, location, stability or hyperbolicity. The proof works with matching systems of local passages and shows that each fixed auxiliary system has finitely many isolated solutions, uniformly as coefficients vary. It does NOT give an explicit or effective B(d)B(d), so it says nothing about the value of H(2)H(2), about Smale's question whether H(d)≤KdqH(d)\le Kd^q, or about the relative positions of cycles asked for in Hilbert's full second part. The exact quintic Lienard bound in the same family is a separate entry.

Theorem 1.1: for each d≥1d\ge1 there is a finite integer B(d)B(d) such that every real planar polynomial vector field of degree at most dd has at most B(d)B(d) limit cycles in the whole plane, with no restriction on coefficients, location, stability or hyperbolicity. The proof works with matching systems of local passages and shows that each fixed auxiliary system has finitely many isolated solutions, uniformly as coefficients vary. It does NOT give an explicit or effective B(d)B(d), so it says nothing about the value of H(2)H(2), about Smale's question whether H(d)≤KdqH(d)\le Kd^q, or about the relative positions of cycles asked for in Hilbert's full second part. The exact quintic Lienard bound in the same family is a separate entry.

Recorded attempts

Evidence graph

Connected research record

The existential Hilbert sixteenth problem: a uniform bound on the number of limit cycles of planar polynomial vector fields — Mathematical Frontier Network