×

Organizing center for the bifurcation analysis of a generalized Gause model with prey harvesting and Holling response function of type III. (English) Zbl 1236.34059

This note is an addendum to the paper [R. M. Etoua and C. Rousseau, J. Differ. Equations 249, No. 9, 2316–2356 (2010; Zbl 1217.34080)], where a generalized Gause model with prey harvesting and a generalized Holling response function of type III: \(p(x)={m x^2 \over a x^2 + b x + 1}\) was studied and complete bifurcation diagrams were proposed. A conjecture was proposed for a nilpotent point of saddle type lying on an invariant line and of codimension greater than or equal to 3. It was conjectured that the nilpotent point is of infinite codimension for \(b=0\). This conjecture was in line with a second conjecture about the codimension of Hopf bifurcation for \(b=0\). These two conjectures are proved in this note. The method of proof is quite original. It consists in finding analytic transformation and time scaling of the system bringing it to a time-reversible system.

MSC:

34C23 Bifurcation theory for ordinary differential equations
34C60 Qualitative investigation and simulation of ordinary differential equation models
92D25 Population dynamics (general)

Citations:

Zbl 1217.34080
Full Text: DOI

References:

[1] Etoua, R.; Rousseau, C., Bifurcation analysis of a generalized Gause model with prey harvesting and a generalized Holling response function of type III, J. Differential Equations, 249, 2316-2356 (2010) · Zbl 1217.34080
[2] Zhu, H.; Rousseau, C., Finite cyclicity of graphics with nilpotent singularity of saddle or elliptic type, J. Differential Equations, 178, 325-436 (2002) · Zbl 1012.34028
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.