Genericity conditions for finite cyclicity of elementary graphics (Q1293260): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jdeq.1998.3570 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064727815 / rank
 
Normal rank

Revision as of 02:19, 20 March 2024

scientific article
Language Label Description Also known as
English
Genericity conditions for finite cyclicity of elementary graphics
scientific article

    Statements

    Genericity conditions for finite cyclicity of elementary graphics (English)
    0 references
    31 January 2000
    0 references
    The authors deal with Hilbert's 16th problem. They explore results by \textit{A. G. Khovanskij} [Sib. Math. J. 25, 502-506 (1984; Zbl 0581.14023)] and by \textit{Yu. S. Il'yashenko} and \textit{S. Yu. Yanenko} [Russ. Math. Surv. 46, No. 1, 1-43 (1991); translation from Usp. Mat. Nauk 46, No. 1(277), 3-39 (1991; Zbl 0744.58006)] to study the number of limit cycles of elementary graphics. In particular, a homoclinic loop through a hyperbolic saddle and graphics with a semi-hyperbolic point, with and without return map, are considered. The genericity conditions needed in that case form a proper subset of the usual methods. Some conditions are nonintrinsic and can be artificially created by action of automorphism groups preserving the normal forms near the singularities. An extension of the method is introduced that treats the usual functional-Pfaffian systems together with the admissible changes of coordinates in the functional equations.
    0 references
    polynomial systems
    0 references
    limit periodic sets
    0 references
    normal form
    0 references
    homoclinic loop
    0 references
    saddle-node
    0 references

    Identifiers