arXivDaily arXiv每日学术速递 周一至周五更新
看起来今天可以划水了
arXiv 2201.02019math.DS
收藏

具有代数间断集的分段线性向量场的Hilbert数

On the Hilbert number for piecewise linear vector fields with algebraic discontinuity set

Douglas D. Novaes

摘要:

希尔伯特第十六问题的第二部分在于确定平面多项式向量场的次数为$n$的极限环数目的上限$\mathcal{H}(n)$。对于$n\geq2$,仍然不知道$\mathcal{H}(n)$是否是有限的。到目前为止所取得的主要成就确立了$\mathcal{H}(n)$的下限。关于渐近行为,最好的结果是$\mathcal{H}(n)$与$n^2\log(n)$增长一样快。在研究文献中已知$n$的小值的更好的下限。在A. Gasull,问题18提出了另一个希尔伯特第十六型问题,即改进$\mathcal{L}(n)$的下界,$n\in\mathbb{N}$,其被定义为具有由次数$n$的代数曲线的分支分离的两个区域的平面分段线性微分系统可以具有的极限环的最大数目。到目前为止,$\mathcal{L}(n)\geq [n/2],$ $n\in\mathbb{N}$是最著名的一般下界。同样,在研究文献中已知$n$的小值的更好的下限。本文利用最近发展起来的二阶Melnikov方法,对非线性不连续流形的非光滑系统,证明了$\mathcal{L}(n)$的增长与$n^2.$一样快。这将通过提供$\mathcal{L}(n)$的下界来实现,它改进了以前对$n\geq 4$的估计。

英文摘要:

The second part of the Hilbert's sixteenth problem consists in determining the upper bound $\mathcal{H}(n)$ for the number of limit cycles that planar polynomial vector fields of degree $n$ can have. For $n\geq2$, it is still unknown whether $\mathcal{H}(n)$ is finite or not. The main achievements obtained so far establish lower bounds for $\mathcal{H}(n)$. Regarding asymptotic behavior, the best result says that $\mathcal{H}(n)$ grows as fast as $n^2\log(n)$. Better lower bounds for small values of $n$ are known in the research literature. In the recent paper "Some open problems in low dimensional dynamical systems" by A. Gasull, Problem 18 proposes another Hilbert's sixteenth type problem, namely improving the lower bounds for $\mathcal{L}(n)$, $n\in\mathbb{N}$, which is defined as the maximum number of limit cycles that planar piecewise linear differential systems with two zones separated by a branch of an algebraic curve of degree $n$ can have. So far, $\mathcal{L}(n)\geq [n/2],$ $n\in\mathbb{N}$, is the best known general lower bound. Again, better lower bounds for small values of $n$ are known in the research literature. Here, by using a recently developed second order Melnikov method for nonsmooth systems with nonlinear discontinuity manifold, it is shown that $\mathcal{L}(n)$ grows as fast as $n^2.$ This will be achieved by providing lower bounds for $\mathcal{L}(n)$, which improves every previous estimates for $n\geq 4$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑