Melnikov theory to all orders and Puiseux series for subharmonic solutions
Livia Corsi, Guido Gentile

TL;DR
This paper develops a method combining Newton-Puiseux and tree formalism to analyze subharmonic bifurcations in analytic systems, revealing solutions are often fractional power series in the perturbation parameter and providing constructive algorithms for their approximation.
Contribution
It introduces a novel approach using Newton-Puiseux and diagrammatic methods to study subharmonic solutions, including cases with zero Melnikov functions, extending existing bifurcation analysis.
Findings
Solutions are fractional power series in the perturbation parameter.
Existence of solutions depends on the order of zero of the Melnikov function.
A constructive algorithm for approximating solutions and bounding their analyticity radius.
Abstract
We study the problem of subharmonic bifurcations for analytic systems in the plane with perturbations depending periodically on time, in the case in which we only assume that the subharmonic Melnikov function has at least one zero. If the order of zero is odd, then there is always at least one subharmonic solution, whereas if the order is even in general other conditions have to be assumed to guarantee the existence of subharmonic solutions. Even when such solutions exist, in general they are not analytic in the perturbation parameter. We show that they are analytic in a fractional power of the perturbation parameter. To obtain a fully constructive algorithm which allows us not only to prove existence but also to obtain bounds on the radius of analyticity and to approximate the solutions within any fixed accuracy, we need further assumptions. The method we use to construct the solution…
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.
