通过Chebyshev拉回和分离方案的二次上限实现极限环复制
Limit-Cycle Replication via Chebyshev Pullbacks and a Quadratic Ceiling for Separable Schemes
AI总结:
本文基于分离Chebyshev覆盖,证明了通过复制机制可生成更多极限环,且分离方案的复制仅能产生二次数量的极限环,从而推导出Hilbert数的下界。
摘要:
设H(n)表示平面多项式向量场度数≤n时最大极限环数。复制是一种经典的下界机制:通过多项式映射拉回向量场,并将每个现有极限环提升为多个不相交的副本,同时控制结果的度数。本文基于分离Chebyshev覆盖Φ(u,v)=(T_m(u),T_m(v)),利用T_m在(-1,1)上的m个单调完整分支,证明每个度数≤n的多项式向量场若有k个极限环,则可生成度数≤nm+m-1的多项式向量场,其极限环数至少为m²k。因此,H(nm+m-1)≥m²H(n)(m≥2)。随后,将构造扩展至一般分离拉回(u,v)→(p(u),p(v)),证明Chebyshev在度数为m的分离拉回中达到最大可能的分支数,并证明仅使用复制机制的方案中,最终极限环数至多与最终度数二次相关。这表明超二次下界,如已知的n²logn型下界,必然需要超越纯分离复制的机制。最后,结合复制定理与目前最强的种子下界,得到几个度数的新显式下界,包括H(14)≥252,H(29)≥1080,H(31)≥1380,H(39)≥2012。
英文摘要:
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*}
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。