UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems

Baigent, SA; (2015) Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems. Journal of Difference Equations and Applications Green open access

[thumbnail of lesliegower_MyFinal.pdf]
Preview
Text
lesliegower_MyFinal.pdf

Download (334kB) | Preview

Abstract

We consider the geometry of carrying simplices of discrete-time competitive Kolmogorov systems. An existence theorem for the carrying simplex based upon the Hadamard graph transform is developed, and conditions for when the transform yields a sequence of convex or concave graphs are determined. As an application it is shown that the planar Leslie-Gower model has a carrying simplex that is convex or concave.

Type: Article
Title: Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems
Open access status: An open access version is available from UCL Discovery
Language: English
Additional information: This is an Author’s Original Manuscript of an article under consideration by Taylor & Francis for publication in the Journal of Difference Equations and Applications.
Keywords: Carrying simplex, convexity and concavity, globally attracting invariant manifold
UCL classification: UCL
UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics
URI: https://discovery.ucl.ac.uk/id/eprint/1472146
Downloads since deposit
157Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item