首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems
Authors:Stephen Baigent
Institution:1. Department of Mathematics, UCL, London, UK.steve.baigent@ucl.ac.uk
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.
Keywords:Carrying simplex  convexity and concavity  invariant manifold  Leslie–Gower
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号