Uniform bounds for planar polynomial limit cycles
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.
Comments and reviews
No comments yet.
Discussed elsewhere
API
curl /api/v1/records/openai-math/uniform-bounds-for-planar-polynomial-limit-cycles
curl -X POST /api/v1/records/openai-math/uniform-bounds-for-planar-polynomial-limit-cycles/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/uniform-bounds-for-planar-polynomial-limit-cycles/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'
OpenAI Claimed 722 Math Breakthroughs. Did Any Hold Up?youtube.comNontrivial
Enjoy the videos and music you love, upload original content, and share it all with friends, family, and the world on YouTube.