<p>In this paper, we first give the relation between the expansions of two Melnikov functions near a heteroclinic loop with two nilpotent cusps of order <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq1.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(m_1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>m</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq2.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(m_2\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>m</mi> <mn>2</mn> </msub> </math></EquationSource> </InlineEquation>(<InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq3.gif" Format="GIF" Height="18" Rendition="HTML" Resolution="72" Type="Linedraw" Width="62" /> </InlineMediaObject> <EquationSource Format="TEX">\(m_i\in {\mathbb {Z}}^+\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>m</mi> <mi>i</mi> </msub> <mo>∈</mo> <msup> <mrow> <mi mathvariant="double-struck">Z</mi> </mrow> <mo>+</mo> </msup> </mrow> </math></EquationSource> </InlineEquation>). Then, we derive a general condition for the existence of as many limit cycles as possible near the heteroclinic loop. Let <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="61" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {H}}(n, m)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">H</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> denote the maximum number of limit cycles for the Liénard equation <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="161" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ddot{x}+\varepsilon f(x)\dot{x}+g(x)=0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover accent="true"> <mi>x</mi> <mo>¨</mo> </mover> <mo>+</mo> <mi>ε</mi> <mi>f</mi> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mover accent="true"> <mi>x</mi> <mo>˙</mo> </mover> <mo>+</mo> <mi>g</mi> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq6.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="73" /> </InlineMediaObject> <EquationSource Format="TEX">\(\deg {f}=n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>deg</mo> <mi>f</mi> <mo>=</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq7.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="76" /> </InlineMediaObject> <EquationSource Format="TEX">\(\deg {g}=m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>deg</mo> <mi>g</mi> <mo>=</mo> <mi>m</mi> </mrow> </math></EquationSource> </InlineEquation>. We prove that <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq8.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="252" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {H}}(n, 7)\ge 2n-1 -2\!\left[ \frac{n+1}{8}\right] -\left[ \frac{n-1}{8}\right] \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">H</mi> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mn>7</mn> <mo stretchy="false">)</mo> </mrow> <mo>≥</mo> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>-</mo> <mn>2</mn> <mspace width="-0.166667em" /> <mfenced close="]" open="["> <mfrac> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> <mn>8</mn> </mfrac> </mfenced> <mo>-</mo> <mfenced close="]" open="["> <mfrac> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> <mn>8</mn> </mfrac> </mfenced> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq9.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\ge 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, where the limit cycles are all near a heteroclinic loop with two nilpotent cusps. Notably, this result improves the existing lower bound of <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq10.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {H}}(n, 7)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">H</mi> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mn>7</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12346_2025_1348_Article_IEq11.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="51" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\ge 12\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>12</mn> </mrow> </math></EquationSource> </InlineEquation>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Some Properties of Melnikov Function and the Number of Limit Cycles Near a Heteroclinic Loop with Two Nilpotent Cusps

  • Deyue Ma,
  • Junmin Yang

摘要

In this paper, we first give the relation between the expansions of two Melnikov functions near a heteroclinic loop with two nilpotent cusps of order \(m_1\) m 1 and \(m_2\) m 2 ( \(m_i\in {\mathbb {Z}}^+\) m i Z + ). Then, we derive a general condition for the existence of as many limit cycles as possible near the heteroclinic loop. Let \({\mathcal {H}}(n, m)\) H ( n , m ) denote the maximum number of limit cycles for the Liénard equation \(\ddot{x}+\varepsilon f(x)\dot{x}+g(x)=0\) x ¨ + ε f ( x ) x ˙ + g ( x ) = 0 with \(\deg {f}=n\) deg f = n and \(\deg {g}=m\) deg g = m . We prove that \({\mathcal {H}}(n, 7)\ge 2n-1 -2\!\left[ \frac{n+1}{8}\right] -\left[ \frac{n-1}{8}\right] \) H ( n , 7 ) 2 n - 1 - 2 n + 1 8 - n - 1 8 for \(n\ge 1\) n 1 , where the limit cycles are all near a heteroclinic loop with two nilpotent cusps. Notably, this result improves the existing lower bound of \({\mathcal {H}}(n, 7)\) H ( n , 7 ) for \(n\ge 12\) n 12 .