Asymptotic lower bounds on Hilbert numbers using canard cycles (Q2286682): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 12:51, 2 February 2024

scientific article
Language Label Description Also known as
English
Asymptotic lower bounds on Hilbert numbers using canard cycles
scientific article

    Statements

    Asymptotic lower bounds on Hilbert numbers using canard cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2020
    0 references
    Consider real planar systems \[ \frac{dx}{dt}=P(x,y),\ \frac{dy} {dt}=Q(x,y),\tag{\(*\)} \] where \(P\) and \(Q\) are polynomials of degree \(N\). The maximum number of limit cycles of system (\(*\)) is denoted by the Hilbert number \(H(N)\). For systems with lower degree \(N\) lower bounds for \(H(N)\) are known, e.g. \(H(2)\ge 4\), \(H(3)\ge 13\). The goal of the authors is to derive asymptotic lower bounds for \(H(N)\). Their main result reads Theorem. There exists a function \(\underline{H}: \mathbb{N}\to\mathbb{R}\) with the property \[ \underline{H}(N)=\left( \frac{N^2\log N}{2(\log 2)}\right)(1+o(1))\text{ as }N\to\infty, \] and a sequence \((N_k)_{k\in\mathbb{N}}\) with \(N_k\to\infty\) as \(k\to\infty\) and for which \[ H(N_k)\ge\underline{H}(N_k)\text{ for all }k\in \mathbb{N}. \] The authors note that the systems where the lower bound is reached are singularly perturbed systems. Hence, the proof of the theorem is based on the study of the maximum number of limit cycles of the singularly perturbed Liénard systems \[ \frac{dx}{dt}=y-F(x),\ \frac{dy}{dt}=\varepsilon G(x), \] where geometric singular perturbation theory including the concepts of canard cycles, canard nests and singular Hopf bifurcation play a fundamental role.
    0 references
    Hilbert number
    0 references
    slow-fast system
    0 references
    canard cycle
    0 references
    limit cycle
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references