pith. sign in

arxiv: 2604.12883 · v1 · submitted 2026-04-14 · 🧮 math.DS

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

Olimjon Eshkobilov , Shirali Kadyrov , Khudoyor Mamayusupov This is my paper

Pith reviewed 2026-05-10 14:19 UTC · model grok-4.3

classification 🧮 math.DS
keywords limit cyclesHilbert numberChebyshev polynomialspolynomial vector fieldsreplicationplanar dynamical systemslower boundsseparable maps
0
0 comments X

The pith

Chebyshev pullbacks multiply limit cycles by m squared in a polynomial vector field of degree at most nm + m - 1.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows how to take any planar polynomial vector field of degree at most n that has k limit cycles and produce a new polynomial vector field of degree at most nm + m - 1 that has at least m squared times as many limit cycles. The construction uses a separable map built from Chebyshev polynomials of the first kind, whose m monotone branches on the open interval (-1,1) lift each cycle to m squared disjoint copies. This yields the recursive lower bound H(nm + m - 1) is at least m squared times H(n) for every m at least 2. The authors further prove that any scheme relying only on iterated separable pullbacks produces at most quadratically many limit cycles relative to the final degree, so stronger lower bounds must use additional mechanisms. They combine the new replication step with known seed bounds to list explicit improvements such as H(14) at least 252.

Core claim

Using the separable Chebyshev covering map that sends (u, v) to (T_m(u), T_m(v)), the construction lifts each of the k limit cycles to m² disjoint copies in the pulled-back system, which remains polynomial of degree at most nm + m - 1. This establishes the inequality H(nm + m - 1) ≥ m² H(n) for integers m ≥ 2. Among all separable pullbacks of degree m, the Chebyshev choice maximizes the number of monotone branches and thus the replication factor. Iterating only such separable replications produces at most quadratically many limit cycles in the final degree, so superquadratic bounds require non-replication mechanisms.

What carries the argument

The separable Chebyshev covering Φ(u,v) = (T_m(u), T_m(v)), which uses the m monotone branches of the Chebyshev polynomial T_m on (-1,1) to replicate each cycle m² times while keeping the resulting vector field polynomial of degree at most nm + m - 1.

If this is right

  • The Hilbert number obeys the recursive inequality H(nm + m - 1) ≥ m² H(n) for every m ≥ 2.
  • Pure replication via separable polynomial maps yields at most quadratically many limit cycles in the final degree.
  • Combining the replication step with existing seed bounds produces the concrete estimates H(14) ≥ 252, H(29) ≥ 1080, H(31) ≥ 1380 and H(39) ≥ 2012.
  • Chebyshev pullbacks achieve the largest possible replication factor among all separable degree-m maps.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The quadratic ceiling implies that further progress on lower bounds for H(n) will require constructions that are not purely separable.
  • Applying the map to concrete vector fields with known small numbers of cycles would let one check whether the replication is exact in practice.
  • The same branch-counting idea might extend to other families of polynomials that also possess many real preimages.

Load-bearing premise

That the pullback by the Chebyshev map lifts every existing limit cycle to exactly m squared new disjoint cycles without creating extras or exceeding the stated degree bound.

What would settle it

An explicit low-degree vector field with one known limit cycle whose image under the m=2 Chebyshev pullback has either fewer than four cycles, more than four cycles, or requires degree higher than 2n + 1.

Figures

Figures reproduced from arXiv: 2604.12883 by Khudoyor Mamayusupov, Olimjon Eshkobilov, Shirali Kadyrov.

Figure 1
Figure 1. Figure 1: Chebyshev polynomial Tm (here m = 6). The points ck = cos(kπ/m) partition [−1, 1] into intervals Ik = (ck, ck−1) on which Tm is strictly monotone and maps Ik onto (−1, 1). strictly monotone and has range (−1, 1) on that open interval. Therefore Tm is strictly monotone on Ik and maps it onto (−1, 1), giving a diffeomorphism and T ′ m ̸= 0 on Ik [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Replication schematic. A limit cycle γℓ ⊂ Sρ lifts under Φ(u, v) = (Tm(u), Tm(v)) to disjoint cycles γeℓ,ij inside the branch rectangles Ii × Ij (one shown per rectangle). On each rectangle, DΦ · Y = λ X ◦ Φ with λ = T ′ m(u)T ′ m(v) ̸= 0. m2 disjoint branch rectangles Ii × Ij . As illustrated in [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Commutative diagram for the conjugacy relation. [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Visual illustration of the worked example in Section 6. [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
read the original 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 \[ \Phi(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*}

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript establishes a self-contained replication theorem for planar polynomial vector fields using the separable Chebyshev covering map Φ(u,v)=(T_m(u),T_m(v)). It proves that any degree-≤n vector field with k limit cycles lifts to a degree-≤(nm+m-1) vector field with at least m²k limit cycles, yielding the inequality H(nm+m-1)≥m²H(n) for m≥2. The work extends the construction to general separable pullbacks, shows Chebyshev maximizes the number of monotone branches, establishes a quadratic ceiling on the number of limit cycles obtainable by iterated separable replication alone, and derives new explicit lower bounds including H(14)≥252, H(29)≥1080, H(31)≥1380, and H(39)≥2012.

Significance. If the central lifting argument is rigorous, the paper supplies a parameter-free, fully self-contained mechanism for generating lower bounds on the Hilbert number H(n) that relies only on the branch-counting geometry of Chebyshev polynomials. The quadratic-ceiling result is a useful negative statement showing that known super-quadratic lower bounds (n² log n type) must employ mechanisms outside pure separable replication. The explicit numerical improvements are concrete and immediately usable. The self-contained character and absence of fitted parameters are clear strengths.

major comments (2)
  1. [Main replication theorem (lifted vector field construction)] Construction of the lifted field (X_new = (T_m'(v) P∘Φ, T_m'(u) Q∘Φ), λ = T_m'(u)T_m'(v)): the relation dΦ(X_new) = λ (X_old ∘ Φ) holds, but the claim that exactly m² disjoint limit cycles are produced requires a detailed verification that the horizontal and vertical trajectories on the m-1 critical lines {T_m'=0} do not create additional closed orbits, nor do new cycles appear at |u|=1, |v|=1, or at infinity. The monotone-branch argument on (-1,1) alone does not address these loci.
  2. [Quadratic ceiling section] Quadratic-ceiling theorem for iterated separable schemes: the upper bound assumes that 'no additional limit cycles are created beyond those forced by lifting.' This hypothesis must be stated as a precise, checkable condition on the iterated maps; without it the conclusion that super-quadratic growth requires non-separable mechanisms rests on an unformalized premise.
minor comments (2)
  1. The introduction should explicitly name the 'strongest currently published seed bounds' used to obtain the concrete estimates H(14)≥252 etc., rather than leaving the combination implicit.
  2. Notation for the pullback Φ and the multiplier λ should be introduced once in a dedicated preliminary section and used consistently thereafter.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading, the positive evaluation of the paper's significance, and the constructive major comments. We address each point below and will revise the manuscript accordingly to strengthen the rigor of the arguments.

read point-by-point responses

  1. Referee: Construction of the lifted field (X_new = (T_m'(v) P∘Φ, T_m'(u) Q∘Φ), λ = T_m'(u)T_m'(v)): the relation dΦ(X_new) = λ (X_old ∘ Φ) holds, but the claim that exactly m² disjoint limit cycles are produced requires a detailed verification that the horizontal and vertical trajectories on the m-1 critical lines {T_m'=0} do not create additional closed orbits, nor do new cycles appear at |u|=1, |v|=1, or at infinity. The monotone-branch argument on (-1,1) alone does not address these loci.

    Authors: We agree that the current presentation relies primarily on the monotone-branch counting within (-1,1) and would benefit from explicit verification on the remaining loci. In the revised manuscript we will insert a new lemma (or expanded subsection) that analyzes the lifted vector field on the critical lines {T_m'=0}, on the boundaries |u|=1 and |v|=1, and at infinity. On each critical line the components of X_new reduce to strictly horizontal or vertical motion that cannot close into a periodic orbit inside the relevant compactified domain; the same holds for the boundary circles and the Poincaré compactification at infinity. This additional analysis will confirm that no extraneous cycles are created and that precisely m² disjoint lifts are obtained from each original cycle. revision: yes

  2. Referee: Quadratic-ceiling theorem for iterated separable schemes: the upper bound assumes that 'no additional limit cycles are created beyond those forced by lifting.' This hypothesis must be stated as a precise, checkable condition on the iterated maps; without it the conclusion that super-quadratic growth requires non-separable mechanisms rests on an unformalized premise.

    Authors: We accept the referee's observation that the hypothesis requires a more formal, checkable statement. In the revision we will restate the quadratic-ceiling theorem with an explicit hypothesis: for every iterated separable pullback, the only limit cycles present in the resulting vector field are the direct lifts of cycles from the preceding stage; no additional periodic orbits arise on the critical sets, outside the images of the monotone branches, or through interactions at infinity. Under this precisely formulated condition the total number of cycles remains at most quadratic in the final degree, thereby rigorously implying that any super-quadratic lower bound must employ mechanisms beyond pure separable replication. revision: yes

Circularity Check

0 steps flagged

No significant circularity; replication bound follows directly from Chebyshev branch geometry and explicit pullback construction.

full rationale

The central inequality H(nm+m-1) ≥ m² H(n) is obtained by exhibiting an explicit degree-(nm+m-1) vector field X_new whose orbits are in bijective correspondence with those of the original field on the m² open rectangles formed by the monotone branches of T_m. The construction X_new = (T_m'(v) P∘Φ, T_m'(u) Q∘Φ) is algebraic and uses only the chain-rule identity dΦ(X_new) = λ (X_old ∘ Φ) with λ = T_m'(u)T_m'(v). The paper then argues, via the monotonicity of each branch on (-1,1) and the fact that λ vanishes only on a finite union of lines, that no additional limit cycles are created inside those rectangles or at infinity. This argument is internal to the manuscript and does not invoke any prior result whose constants were fitted to the target bound. The quadratic-ceiling statement is explicitly conditional on the assumption that only lifted cycles appear, so it does not claim an unconditional theorem. The numerical lower bounds are obtained by feeding the replication map into externally published seed values for H(n) at small n; those seeds are independent of the present work. Consequently the derivation chain contains no self-definitional step, no fitted input renamed as prediction, and no load-bearing self-citation.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the known branch structure of Chebyshev polynomials (standard) and the assumption that the pullback operation preserves the polynomial character and exactly multiplies the cycle count by the product of branch numbers without extras (domain assumption). No free parameters or invented entities are introduced.

axioms (2)
  • standard math Chebyshev polynomial T_m of degree m has exactly m distinct real roots and m monotone branches on (-1,1).
    Invoked to count the number of preimages and to guarantee the degree of the pulled-back vector field.
  • standard math The pullback of a polynomial vector field by a polynomial map remains a polynomial vector field whose degree is bounded by the product of the degrees plus adjustments for the components.
    Used to obtain the precise degree bound nm+m-1.

pith-pipeline@v0.9.0 · 5683 in / 1614 out tokens · 27690 ms · 2026-05-10T14:19:29.713476+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [1]

    Asymptotic lower bounds on hilbert numbers using canard cycles.Journal of Differential Equations, 268(7):3370–3391, 2020

    Maria Jesus Álvarez, Bartomeu Coll, Peter De Maesschalck, and Rafel Prohens. Asymptotic lower bounds on hilbert numbers using canard cycles.Journal of Differential Equations, 268(7):3370–3391, 2020

    work page 2020

  2. [2]

    A note on a recent attempt to solve the second part of hilbert’s 16th problem.arXiv preprint arXiv:2411.09594, 2024

    Claudio A Buzzi and Douglas D Novaes. A note on a recent attempt to solve the second part of hilbert’s 16th problem.arXiv preprint arXiv:2411.09594, 2024

    work page arXiv 2024

  3. [3]

    Polynomial systems: a lower bound for the hilbert numbers.Proceedings of the Royal Society of London

    Colin J Christopher and Noel G Lloyd. Polynomial systems: a lower bound for the hilbert numbers.Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 450(1938):219– 224, 1995

    work page 1938

  4. [4]

    Estimates for the number of limit cycles in discontinuous generalized liénard equations.Qualitative Theory of Dynamical Systems, 23(4):187, 2024

    Tiago MP de Abreu and Ricardo M Martins. Estimates for the number of limit cycles in discontinuous generalized liénard equations.Qualitative Theory of Dynamical Systems, 23(4):187, 2024

    work page 2024

  5. [5]

    Artés.Qualitative theory of planar differential systems

    Freddy Dumortier, Jaume Llibre, and Joan C. Artés.Qualitative theory of planar differential systems. Universitext. Springer, Berlin, Heidelberg, 2006

    work page 2006

  6. [6]

    From abel’s differential equations to hilbert’s sixteenth problem.Butl

    Armengol Gasull. From abel’s differential equations to hilbert’s sixteenth problem.Butl. Soc. Catalana Mat, 28(2):123–146, 2013

    work page 2013

  7. [7]

    Limit cycles and invariant algebraic curves.Communications on Pure and Applied Analysis, 28:214–220, 2025

    Armengol Gasull and Paulo Santana. Limit cycles and invariant algebraic curves.Communications on Pure and Applied Analysis, 28:214–220, 2025

    work page 2025

  8. [8]

    A note on hilbert 16th problem

    Armengol Gasull and Paulo Santana. A note on hilbert 16th problem. Proceedings of the American Mathematical Society, 153(02):669–677, 2025

    work page 2025

  9. [9]

    A polynomial system of degree four with an invariant square containing at least five limit cycles.Qualitative Theory of Dynamical Systems, 23(5):247, 2024

    Maite Grau and Iván Szántó. A polynomial system of degree four with an invariant square containing at least five limit cycles.Qualitative Theory of Dynamical Systems, 23(5):247, 2024

    work page 2024

  10. [10]

    Lower bounds for the hilbert number of polynomial systems.Journal of Differential Equations, 252(4):3278– 3304, 2012

    Maoan Han and Jibin Li. Lower bounds for the hilbert number of polynomial systems.Journal of Differential Equations, 252(4):3278– 3304, 2012

    work page 2012

  11. [11]

    Centennial history of hilbert’s 16th problem.Bulletin of the American Mathematical Society, 39(3):301–354, 2002

    Yu Ilyashenko. Centennial history of hilbert’s 16th problem.Bulletin of the American Mathematical Society, 39(3):301–354, 2002. 24

    work page 2002

  12. [12]

    Finiteness theorems for limit cycles.Russian Mathe- matical Surveys, 45(2):129–203, 1990

    Yu S Il’yashenko. Finiteness theorems for limit cycles.Russian Mathe- matical Surveys, 45(2):129–203, 1990

    work page 1990

  13. [13]

    Some lower bounds for h (n) in hilbert’s 16th problem.Qualitative Theory of Dynamical Systems: 3, 2, 2002, pages 345–360, 2002

    Jibin Li, HSY Chan, and KW Chung. Some lower bounds for h (n) in hilbert’s 16th problem.Qualitative Theory of Dynamical Systems: 3, 2, 2002, pages 345–360, 2002

    work page 2002

  14. [14]

    Springer, New York, NY, 2013

    Lawrence Perko.Differential equations and dynamical systems, volume 7 ofTexts in Applied Mathematics. Springer, New York, NY, 2013

    work page 2013

  15. [15]

    New lower bounds for the hilbert numbers using reversible centers.Nonlinearity, 32(1):331–355, 2019

    Rafel Prohens and Joan Torregrosa. New lower bounds for the hilbert numbers using reversible centers.Nonlinearity, 32(1):331–355, 2019

    work page 2019

  16. [16]

    Springer, Basel, 1998

    Robert Roussarie and Robert Roussarie.Bifurcation of planar vector fields and Hilbert’s sixteenth problem, volume 164 ofModern Birkhäuser Classics. Springer, Basel, 1998

    work page 1998

  17. [17]

    Mathematical problems for the next century.The Mathe- matical Intelligencer, 20(2):7–15, March 1998

    Steve Smale. Mathematical problems for the next century.The Mathe- matical Intelligencer, 20(2):7–15, March 1998. 25

    work page 1998