On the cyclicity of hyperbolic polycycles
Claudio Buzzi, Armengol Gasull, Paulo Santana
TL;DR
The paper studies the cyclicity of a hyperbolic polycycle $\Gamma^n$ in planar vector fields by linking the cyclicity to the product of hyperbolicity ratios $r_i$ through a combinatorial measure $\Delta(\Gamma^n)$ computed over permutations. It leverages sharp regularity results for the Dulac map due to Marin–Villadelprat to control how perturbations unfold heteroclinic connections, and constructs displacement maps that track bifurcations of limit cycles when breaking the polycycle. The main contribution is a general lower bound $\textit{Cycl}(X,\mathcal{X},\Gamma^n)\ge\Delta(\Gamma^n)$, extended to the smooth and polynomial settings, together with a method to realize these bounds via polynomial perturbations (even of high degree) and an explicit inverse problem demonstrating realizability of prescribed hyperbolicity data. The results illuminate how many limit cycles can emerge from a polycycle under small perturbations and provide concrete polynomial realizations and examples, with implications for the broader theory of polycycle unfolding and cyclicity in planar systems.
Abstract
Let $X$ be a planar smooth vector field with a polycycle $Γ^n$ with $n$ sides and all its corners, that are at most $n$ singularities, being hyperbolic saddles. In this paper we study the cyclicity of $Γ^n$ in terms of the hyperbolicity ratios of these saddles, giving explicit conditions that ensure that it is at least $k,$ for any $k\leqslant n.$ Our result extends old results and also provides a more accurate proof of the known ones because we rely on some recent powerful works that study in more detail the regularity with respect to initial conditions and parameters of the Dulac map of hyperbolic saddles for families of vector fields. We also prove that when $X$ is polynomial there is a polynomial perturbation (in general with degree much higher that the one of $X$) that attains each of the obtained lower bounds for the cyclicities. Finally, we also study some related inverse problems and provide concrete examples of applications in the polynomial world.
