|
Uniform limit-cycle bounds in Hilbert's sixteenth problem
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
|
>>> Check out Coolmath's new
Snaky <<<
|
LOADING...
0%
thinking... about 3 hours remaining
GAME #143
Uniform limit-cycle bounds in Hilbert's sixteenth problem
How many loops can a polynomial vector field draw? Hilbert asked in 1900. Can you beat his high score?
PLAY
LEAN VERIFIED
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model
| >>> How to Play <<< |
| Hilbert's sixteenth problem: uniform bounds for limit cycles. Resolves the uniform boundedness assertion in Hilbert's sixteenth problem: the number of isolated periodic orbits of a real planar polynomial vector field is bounded by a finite constant depending only on its degree. For classical quintic Liénard systems, the exact maximum is two limit cycles. |
| >>> Level Select <<< |
|
For every degree, we prove that the number of isolated periodic orbits of a real planar polynomial vector field is bounded by a finite constant depending only on that degree. This establishes the uniform boundedness assertion in the second part of Hilbert's sixteenth problem. The proof uses separation of asymptotic expansions on nested complex domains and a finite-dimensional counting argument.
| |
Every classical Liénard system $\dot x=y-F(x)$, $\dot y=-x$, with F an arbitrary real polynomial of degree at most five, has at most two geometrically distinct isolated periodic orbits, and the bound is attained. This proves the degree-five case of the Lins Neto–de Melo–Pugh conjecture.
|
|