Limit-Cycle Replication via Chebyshev Pullbacks and a Quadratic Ceiling for Separable Schemes

Abstract: Let (H(n)) denote the Hilbert number, i.e.\ the maximal number of limit cycles of planar polynomial vector fields of degree (\le n). A classical lower-bound mechanism for (H(n)) is \emph{replication}: one pulls back a vector field by a polynomial map and lifts each existing limit cycle to several disjoint copies while controlling the resulting degree. In this paper we give a fully self-contained replication theorem based on the separable Chebyshev covering [ Φ(u,v)=(T_m(u),T_m(v)). ] Using the (m) monotone full branches of (T_m) on ((-1,1)), we prove that every degree-(\le n) polynomial vector field with (k) limit cycles gives rise to a degree-(\le nm+m-1) polynomial vector field with at least (m^2k) limit cycles. Consequently, [ H(nm+m-1)\ge m^2H(n)\qquad (m\ge 2). ] We then extend the construction to general separable pullbacks ((u,v)\mapsto (p(u),p(v))), show that Chebyshev attains the maximal possible branch count among degree-(m) separable pullbacks, and prove a quadratic ceiling for replication-only schemes: if one iterates separable pullbacks and no additional limit cycles are created beyond those forced by lifting, then the number of resulting limit cycles is at most quadratic in the final degree. This shows that superquadratic lower bounds, such as the known (n^2\log n)-type bounds, necessarily require mechanisms beyond pure separable replication. Finally, combining our replication theorem with the strongest currently published seed bounds, we obtain new explicit lower estimates in several degrees, including \begin{gather*} H(14)\ge 252,\qquad H(29)\ge 1080,\ H(31)\ge 1380,\qquad H(39)\ge 2012. \end{gather*}

• The paper establishes a Chebyshev pullback method that replicates limit cycles via separable, monotone polynomial branches.
• It proves sharp degree-amplification inequalities and sets new lower bounds for the Hilbert number H(n) in specific polynomial degrees.
• The study demonstrates that separable replication is limited by a quadratic ceiling, highlighting inherent constraints in the branch-lifting approach.

Limit-Cycle Replication via Chebyshev Pullbacks: Summary and Analysis

Introduction and Problem Setting

The paper "Limit-Cycle Replication via Chebyshev Pullbacks and a Quadratic Ceiling for Separable Schemes" (2604.12883) addresses constructive lower bounds for the Hilbert number $H(n)$, the maximal number of limit cycles of a planar polynomial vector field of degree at most $n$. This longstanding open problem, the second part of Hilbert’s 16th, lies at the interface of real algebraic geometry, qualitative ODEs, and dynamical systems. The foundational approach for constructing lower bounds for $H(n)$ is via replication: pulling back vector fields through suitable coverings to amplify the count of limit cycles while quantifying the resulting degree expansion.

The paper gives a mathematically explicit, self-contained analytic framework for replication via separable polynomial maps, with a focus on the optimal Chebyshev pullback

$\Phi(u,v) = (T_m(u), T_m(v))$

where $T_m$ is the Chebyshev polynomial of degree $m$. From the perspective of lower-bound constructions for $H(n)$, the authors clarify the amplification limits of separable replication, prove sharp degree-amplification inequalities, and derive new records for $H(n)$ in several specific degrees.

Chebyshev Polynomials and Branch Geometry

A central technical ingredient is the monotonic branch structure of Chebyshev polynomials. For $m\geq 2$, $T_m$ possesses $n$0 monotone full branches on $n$1, each diffeomorphic onto $n$2. The paper formalizes this in Lemma 3.2, partitioning $n$3 via the sequence $n$4. On each interval $n$5, $n$6 is strictly monotone and surjective onto $n$7.

Figure 1: Chebyshev polynomial $n$8 ($n$9) and its partition into $H(n)$0 monotone full-branch intervals.

This structure ensures that $H(n)$1 partitions the domain into $H(n)$2 rectangles where $H(n)$3 is a diffeomorphism, providing a framework for highly structured replication of periodic trajectories.

Chebyshev Replication Theorem

The main replication theorem is as follows:

For any $H(n)$4 and $H(n)$5,

$H(n)$6

That is, every planar polynomial vector field of degree $H(n)$7 with $H(n)$8 limit cycles yields, via Chebyshev pullback, a new vector field of degree $H(n)$9 with at least $\Phi(u,v) = (T_m(u), T_m(v))$0 limit cycles.

The proof utilizes two elementary invariance principles: (1) affine coordinate changes preserve degree and location of limit cycles; (2) multiplying a vector field by a nowhere-vanishing function does not alter the orbit structure or isolation of limit cycles.

Figure 2: Replication schematic: a cycle $\Phi(u,v) = (T_m(u), T_m(v))$1 lifts under $\Phi(u,v) = (T_m(u), T_m(v))$2 to $\Phi(u,v) = (T_m(u), T_m(v))$3 disjoint cycles in branch rectangles.

On each rectangle $\Phi(u,v) = (T_m(u), T_m(v))$4, the pullback field is explicitly constructed such that its trajectories correspond, up to time reparametrization, to those of the seed field. The commutative diagram formalizes this conjugacy.

Figure 3: Commutative diagram for orbit and return-map conjugacy under the Chebyshev pullback.

Exact Degree Counts and Quadratic Ceiling

A detailed algebraic analysis shows that the degree of the pullback field $\Phi(u,v) = (T_m(u), T_m(v))$5 satisfies

$\Phi(u,v) = (T_m(u), T_m(v))$6

with equality generically. The $\Phi(u,v) = (T_m(u), T_m(v))$7 factor in the lower-bound is optimal over all separable pullbacks of degree $\Phi(u,v) = (T_m(u), T_m(v))$8, as any real polynomial of degree $\Phi(u,v) = (T_m(u), T_m(v))$9 has at most $T_m$0 monotone full branches onto $T_m$1 — equality is achieved by $T_m$2.

The paper systematically generalizes to arbitrary separable maps $T_m$3 and proves that replication alone cannot yield more than quadratic growth in the number of limit cycles as the degree increases:

$T_m$4

where $T_m$5 is derived from $T_m$6 by $T_m$7 iterated separable pullbacks. This quadratic ceiling isolates the structural limitations of purely separable, branch-lifting replication.

Numerical Improvements and Degree-Specific Records

Combining the Chebyshev replication theorem with the best seed bounds in the literature, the authors obtain several new degree-specific lower bounds for $T_m$8, explicitly outperforming previously published values for $T_m$9, $m$0, $m$1, and $m$2, among others. For example:

$m$3

These results leverage the optimality and explicitness of the Chebyshev framework to yield improved lower bounds in concrete instances.

Worked Example: Cubic System and $m$4 Replication

The paper provides a transparent, visual worked example: starting from a classical cubic vector field possessing a unique hyperbolic limit cycle (the circle $m$5), the authors apply the Chebyshev pullback with $m$6.

Figure 4: Visual illustration: (left) original cubic limit cycle; (right) $m$7 disjoint lifts after Chebyshev pullback.

The lift realizes exactly 9 disjoint, isolated limit cycles, one in each branch rectangle, in a degree-11 system, demonstrating the concrete mechanics and count-amplification capacity of the method.

Theoretical Implications

The Chebyshev-based replication theorem sharpens our understanding of the algebraic and combinatorial limitations of cycle-replication via polynomial coverings. The quadratic ceiling result demonstrates that previously published superquadratic (e.g., $m$8) lower bounds for $m$9 cannot be explained by replication alone and necessarily require additional non-replication mechanisms, such as local bifurcations and non-separable coverings.

Notably, the paper raises the open problem of extending the analysis to non-separable polynomial coverings $H(n)$0, where quantifying the 2D branch geometry may permit replication schemes surpassing the quadratic ceiling established for separable maps.

Practical Implications

While the ultimate finiteness and exact asymptotics of $H(n)$1 remain unknown, the Chebyshev replication framework provides a powerful algebraic tool for constructing explicit families of polynomial vector fields with large numbers of limit cycles at controlled degrees. This is relevant for both theoretical scenarios (e.g., partial answers to Smale’s Problem 6) and for generating test cases in applications of qualitative ODE theory.

Conclusion

This paper establishes a mathematically rigorous, optimal, and explicit methodology for replication-based lower bounds on the Hilbert number via Chebyshev polynomial pullbacks. It provides new degree-specific records, characterizes the structural limitations of pure separable schemes, and motivates further research into non-separable replication mechanisms and hybrid cycle-creation strategies. The work clarifies the algebraic limits of pullback amplification and provides transparent techniques for both numerical and conceptual advances in the theory of planar polynomial vector fields.