Abstract
In this paper, the problem of bifurcation of limit cycles from degenerate singular point and infinity in a class of septic polynomial differential systems is investigated. Using the computer algebra system Mathematica, the limit cycle configurations of {(8),3} and {(3),6} are obtained under synchronous perturbation at degenerate singular point and infinity. To our knowledge, up to now, this is the first time that the problem of limit cycles bifurcated from degenerate singular point and infinity under synchronous perturbed conditions in a septic system has been investigated.MSC:34C05, 34C07.
Highlights
In the qualitative theory of planar dynamical systems, bifurcation of limit cycles for planar polynomial differential system dx dy = P(x, y), = Q(x, y), ( . )dt dt which belongs to the second part of the Hilbert th problem, is known as a hot but intractable issue
As far as the number of limit cycles bifurcated from infinity is concerned, representative results are as follows: cubic systems, [ ] got I ≥, [ ] got I ≥, [ ] got I ≥, [, ] got I ≥ ; quintic systems, [ ] got I ≥, [ ] got I ≥, [ ] got I ≥, [ ] got I ≥ ; septic systems, [ ] got I ≥, [ ] got I ≥, [ ] got I ≥
Few papers are concerned with bifurcation of limit cycles from the origin and infinity under synchronous perturbation: [ ] obtained the limit cycle configurations of {( ), } and {( ), } in a cubic polynomial differential system; [ ] and [ ] respectively got the limit cycle configurations of {( ), }, {( ), } and {( ), }, {( ), } in two certain quintic systems
Summary
We deal with limit cycles bifurcated from degenerate singular point and infinity under synchronous perturbation in the following real septic polynomial differential system: dx dt ) is either a center or a focus, and it is a degenerate singular point. Singular point quantities and center conditions at degenerate singular point From Theorem . F k(z, w) = α+β= k cαβ zαwβ , and for any positive integer m, the mth singular point quantity at the origin μ(m ) can be determined by the following recursion formulas: c = , when (α = β > ) or α < or β < , cαβ = ; else cαβ = λ(β – α) ( α – β)c– +α,– +β + b (– + α – β)c– +α,– +β
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
