95
Views
1
CrossRef citations to date
0
Altmetric
Research Article

On existence and uniqueness of a modified carrying simplex for discrete Kolmogorov systems

Pages 284-315 | Received 09 Jun 2020, Accepted 18 Feb 2021, Published online: 04 Mar 2021

References

  • S. Baigent, Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems, J. Differ. Equ. Appl. 22(5) (2016), pp. 609–622.
  • S. Baigent, Convex geometry of the carrying simple for the May–Leonard map, Discret. Contin. Dyn. Syst. B 24(4) (2019), pp. 1697–1723.
  • S. Baigent and Z. Hou, Global stability of discrete-time competitive population models, J. Differ. Equ. Appl. 23 (2017), pp. 1378–1396.
  • E. Cabral Balreira, S. Elaydi, and R. Luís, Global stability of higher dimensional monotone maps, J. Differ. Equ. Appl. 23 (2017), pp. 2037–2071.
  • O. Diekmann, Y. Wang, and P. Yan, Carrying simplices in discrete competitive systems and age-structured semelparous populations, Discrete Contin. Dyn. Syst. 20 (2008), pp. 37–52.
  • M. Gyllenberg, J. Jiang, L. Niu, and P. Yan, On the classification of generalised competitive Atkinson–Allen models via the dynamics on the boundary of the carrying simplex, Discret. Contin. Dyn. Syst. 38 (2018), pp. 615–650.
  • M. Gyllenberg, J. Jiang, and L. Niu, A note on global stability of three-dimensional Ricker models, J. Differ. Equ. Appl. 25 (2019), pp. 142–150.
  • M. Gyllenberg, J. Jiang, L. Niu, and P. Yan, On the dynamics of multi-species Ricker models admitting a carrying simplex, J. Differ. Equ. Appl. 25 (2019), pp. 1489–1530.
  • M.W. Hirsch, Systems of differential equations that are competitive or cooperative. III: Competing species, Nonlinearity 1 (1988), pp. 51–71.
  • M.W. Hirsch, On existence and uniqueness of the carrying simplex for competitive dynamical systems, J. Biol. Dyn. 2(2) (2008), pp. 169–179.
  • Z. Hou, Geometric method for global stability of discrete population models, Discret. Contin. Dyn. Syst. B 25(9) (2020), pp. 3305–3334.
  • Z. Hou, On existence and uniqueness of a carrying simplex in Kolmogorov differential systems, Nonlinearity 33 (2020), pp. 7067–7087.
  • J. Jiang, J. Mierczyński, and Y. Wang, Smoothness of the carrying simplex for discrete-time competitive dynamical systems: A characterization of neat embedding, J. Differ. Equ. 246(4) (2009), pp. 1623–1672.
  • J. Jiang and L. Niu, On the equivalent classification of three-dimensional competitive Atkinson–Allen models relative to the boundary fixed points, Discret. Contin. Dyn. Syst. 36(1) (2016), pp. 217–244.
  • J. Jiang and L. Niu, On the equivalent classification of three-dimensional competitive Leslie–Gower models via the boundary dynamics on the carrying simplex, J. Math. Biol. 74 (2017), pp. 1223–1261.
  • J. Jiang, L. Niu, and Y. Wang, On heteroclinic cycles of competitive maps via carrying simplices, J. Math. Biol. 72 (2016), pp. 939–972.
  • P. Lancaster, Theory of Matrices, Academic Press, New York and London, 1969.
  • A. Ruiz-Herrera, Exclusion and dominance in discrete population models via the carrying simplex, J. Differ. Equ. Appl. 19(1) (2013), pp. 96–113.
  • Y. Wang and J. Jiang, The general properties of discrete-time competitive dynamical systems, J. Differ. Equ. 176 (2001), pp. 470–493.
  • Y. Wang and J. Jiang, Uniqueness and attractivity of the carrying simplex for discrete-time competitive dynamical systems, J. Differ. Equ. 186 (2002), pp. 611–632.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.