Finite cyclicity of some center graphics through a nilpotent point inside quadratic systems
Robert Roussarie, Christiane Rousseau

TL;DR
This paper introduces new methods to prove the finite cyclicity of certain center graphics in quadratic systems through a nilpotent point, advancing the understanding of limit cycles in these systems.
Contribution
The paper develops general techniques for proving finite cyclicity of graphics through nilpotent points, and applies them to specific cases in quadratic vector fields, supporting the DRR program.
Findings
Proved finite cyclicity of graphic (I_{14}^1)
Established finite cyclicity for boundary limit periodic sets in multiple graphics
Extended results to graphics through triple nilpotent points at infinity
Abstract
In this paper we introduce new methods to prove the finite cyclicity of some graphics through a triple nilpotent point of saddle or elliptic type surrounding a center. After applying a blow-up of the family, yielding a singular 3-dimensional foliation, this amounts to proving the finite cyclicity of a family of limit periodic sets of the foliation. The boundary limit periodic sets of these families were the most challenging, but the new methods are quite general for treating such graphics. We apply these techniques to prove the finite cyclicity of the graphic , which is part of the program started in 1994 by Dumortier, Roussarie and Rousseau (and called DRR program) to show that there exists a uniform upper bound for the number of limit cycles of a planar quadratic vector field. We also prove the finite cyclicity of the boundary limit periodic sets in all graphics but one…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
