![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
We study a non-compact version of the carrying simplex for the planar Leslie–Gower and planar Ricker maps when they are written in logarithmic variables. We show that for both of these models there is a convex (unbounded) invariant set , and all orbits are attracted to
. For the Leslie–Gower map, which is injective, the boundary of
globally attracts all orbits and we identify it with a non-compact carrying simplex. As the Ricker map is not invertible, the boundary of
may not be invariant. We establish conditions on the parameters of the Ricker map which guarantee that there is a convex non-compact carrying simplex when r, s<1 which maps into a compact carrying simplex in the standard untransformed coordinates.
1. Introduction
Let ,
and
be a continuous function. Consider the following planar difference equation:
(1)
(1) In this article we are interested in a special invariant curve of (Equation1
(1)
(1) ) known as the carrying simplex. Hirsch's definition [Citation9] of a carrying simplex, when applied to the above system, is as follows.
Definition 1.1
We call a carrying simplex if
(CS1) | Σ is compact and invariant. | ||||
(CS2) | For any | ||||
(CS3) | Σ is unordered. (i.e. for |
When it exists, the carrying simplex Σ is thus a compact and invariant manifold for (Equation1(1)
(1) ) that attracts
and that has the special property that Σ is the graph of a decreasing and continuous function. To date, and to the best of the authors' knowledge, planar carrying simplices for discrete dynamics have been studied exclusively in the context of retrotone systems (e.g. [Citation9,Citation11,Citation17,Citation18]).
This paper explores the pros and cons of working in alternative coordinates where compactness of the carrying simplex is lost.
Definition 1.2
A map is retrotone (e.g. [Citation9,Citation18]) in a subset
if for
such that
and
but
we have
provided
and
provided
.
A retrotone map is sometimes also called a competitive map (see, for example, [Citation19]). In the planar case a map satisfying Definition 1.2 has the special property that it maps the graph of a decreasing function on D to the graph of a new decreasing function on D [Citation2,Citation5].
The Leslie–Gower map from ecology [Citation15] that we study in Section 3.1 is retrotone for all biologically realistic parameter values, and it is well-known that it has a unique carrying simplex [Citation13]. On the other hand, the Ricker map is not retrotone everywhere in (see for example [Citation9,Citation11,Citation18]), and so existence of a carrying simplex in the standard coordinates of population densities, by means of retronicity, is only known for a limited set of parameter values.
Here we will extend the notion of the carrying simplex applied to planar systems to allow it to be non-compact, and we will call a set a non-compact carrying simplex if it satisfies (CS1) without compactness and (CS3), but (CS2) is replaced by the lesser requirement that Σ globally attracts
. The issue of asymptotic completeness will be addressed elsewhere.
In working with non-compact carrying simplices we may work in alternative coordinate systems for which the systems (Equation1(1)
(1) ) that we consider here have at most one (finite) fixed point, but in so doing we lose compactness of the global attractor and asymptotic completeness. We have found that by using logarithmically transformed coordinates, we are sometimes able to obtain stronger geometrical properties for the non-compact carrying simplex, namely that it is the graph of a concave decreasing function. While the corresponding compact carrying simplices are also known to be graphs of decreasing functions, whether or not those functions are convex or concave is not generally known (for results on convexity of carrying simplices see [Citation1,Citation3,Citation4,Citation21]). Here, we will also discuss the convexity of the boundary of the basin of repulsion of infinity in the logarithmically scaled Leslie–Gower and Ricker models. When all the parameters are positive, then the maps in the logarithmically scaled versions of both models are concave (i.e. each component of the map is a concave function [Citation14]). We take advantage of this fact to prove that the basin of repulsion of infinity is an invariant convex set. We establish a relationship between the convexity and the strict decreasingness of the members of a sequence of sets that converges to the boundary of the basin of repulsion of infinity. Then, it becomes straightforward to show that this boundary satisfies (CS3).
2. Preliminary results
In this section, we prove three lemmas that play pivotal roles. The first lemma will enable us to prove that the boundary of each of the sets we are discussing is the graph of a continuous strictly decreasing function. The second lemma shows that for given a set in a certain class of subsets of whose members have boundary that is the graph of a continuous strictly decreasing function, that set must be convex.
Lemma 2.1
Let and
be given. Suppose there exist two continuous functions
and
such that
(2)
(2)
(3)
(3) Then
, both A and B are strictly decreasing functions, and
(4)
(4)
(5)
(5) In other words, the boundary of X is the graph of a strictly decreasing function and X is the set of all points on or under the graph of that function.
Proof.
It is clear that we have
To prove (Equation4
(4)
(4) ), we observe that for each
there exist
and
such that
For each
we have
and
. It follows that since A is continuous we have
Hence,
and
. This proves (Equation4
(4)
(4) ). Proving (Equation5
(5)
(5) ) is similar. It is clear that (Equation4
(4)
(4) ) and (Equation5
(5)
(5) ) imply that A and B are inverse of each other and they are both bijective. Hence, by using the fact that they are continuous functions, we deduce that A and B are strictly decreasing functions (These functions cannot be strictly increasing since
and the boundary of X is equal to each of the graphs of A and B).
Before stating Lemma 2.2, we have to define the relation ‘≪’ between some members of . Let
, we write
if
and
.
Lemma 2.2
Let be the set of points on or under the graph of the continuous strictly decreasing function
. Assume that for every
and
there exists at least one
such that
(6)
(6) Then X is convex.
Proof.
Assume that X is not convex. Then there exist and
such that
Assume that
is as stated in the theorem. Since
and B is strictly decreasing, we have
and since
and
, we have
Hence,
which contradicts (Equation6
(6)
(6) ).
Lemma 2.3
Let be given and suppose that
,
and
are continuous functions and p satisfies
(7)
(7) Suppose also that there exists
defined by
Then G is continuous and
Proof.
Fix . Since the continuous image of a connected set is connected, we deduce that
is connected. Equation (Equation7
(7)
(7) ) implies that
and hence
is unbounded below and there exists
such that for every x<L we have
. Therefore, by compactness of
we deduce that
(8)
(8) Connectedness of
along with the fact that it is unbounded below and
proves
.
We now prove continuity of G by contradiction. Suppose that G is not continuous at some . Then there exist a sequence
which converges to
and
such that for every
we have
. By (Equation8
(8)
(8) ) we know that
. Hence there exists
such that
. Similarly, for every
there exists
such that
. Since K is continuous, we can find a sequence
which converges to
and for every
we have
. By continuity of p and q we have
For every
we have
Thus
(9)
(9) Inequality (Equation9
(9)
(9) ) along with
implies that there exists M>0 such that for every n>M we have
. From (Equation7
(7)
(7) ), there exists
such that for every
and
we have
. Hence for every n>M we have
. This along with the fact that K is continuous, implies that there exists
such that for every
we have
. Thus
is bounded and has a convergent subsequence
. By the continuity of p and q we have
(10)
(10) where
. But it is clear that we also have
which contradicts (Equation10
(10)
(10) ). Therefore, G is continuous at
. Since
is arbitrary we see that G is continuous on
.
We will now combine Lemmas 2.1, 2.2 and 2.3 to show that two well-known maps from theoretical ecology have globally attracting and invariant 1-dimensional manifolds, and also determine when they are the invariant boundary of an invariant convex set.
3. Applications to ecological models
In this section, we use the above theory to prove the convexity of a unique non-compact carrying simplex in logarithmically scaled versions of the Leslie–Gower Model and Ricker models from theoretical ecology.
3.1. The Leslie–Gower model
The planar Leslie–Gower model [Citation7,Citation15] is defined by the Leslie–Gower map
(11)
(11) When r, s<1 and
, then
is globally asymptotically stable on
(see [Citation7]). Hence, the system has no carrying simplex when r, s<1 and
since no
can satisfy (CS2).
When r, s>1 the Leslie–Gower map has fixed points
(12)
(12) A number of authors [Citation1,Citation9,Citation11,Citation12] have shown that for r, s>1 and
, the model (Equation11
(11)
(11) ) has a unique carrying simplex. In our approach, we use an alternative set of coordinates to those in (Equation11
(11)
(11) ): We scale (Equation11
(11)
(11) ) as follows
(13)
(13) to obtain the following log-scaled version of the model:
(14)
(14) The only finite fixed point of the log-scale Leslie–Gower map is
(15)
(15) when the expressions are real.
We wish to study the invariant subsets of , and to this end we define
and finally
(16)
(16) We recall that for a non-empty set
, the ω-limit set of A for a (continuous) map
is defined to be
, (e.g. [Citation20]). In this context
is actually
for f given by (Equation14
(14)
(14) ), but we do not have compactness of any
to apply standard results (e.g. [Citation20, Theorem 2.11]) for ω-limit sets to conclude that
is non-empty and invariant. Instead we prove these facts directly in a series of lemmas below.
The first lemma is needed because standard theorems on non-empty intersections of decreasing sequences of compact sets cannot be applied here as our sets are not compact.
Lemma 3.1
When r, s>1 we have .
Proof.
Suppose that and
are defined as follows:
Since
, there exists
such that for every
we have
,
. Hence if
, for every
we have
. It can also be easily verified that
. Thus
and if we define
, then
. It means that for
we have
. Therefore we have
.
In the following, we rely strongly on the fact that f in (Equation14(14)
(14) ) is invertible.
Lemma 3.2
For the log Leslie–Gower map (Equation14(14)
(14) ) the sets
and
are non-empty and invariant.
Proof.
It is well-known (e.g. [Citation20]) that, for a given and a continuous map
, the omega-limit set
is closed and forward-invariant under f. Therefore,
.
To prove , suppose for the sake of contradiction that there exists
such that
. For every
we have
so that for every
there exists sequence
such that
.
It can be easily proven that . Hence, for every
we have
.
There must be such that
, because otherwise
would not be bounded below which is a contradiction to the fact that
is convergent.
Now from the fact that is bounded, we deduce that it has a limit point
. Since
and
is closed, we have
. And from
, we deduce
. Now, since f is invertible,
is the only point whose value of f is equal to
. It means that for every
we would have the same
for that
. Therefore, for every
, we have
, thus
and
. This proves
. And along with the fact that
is forward invariant, we have
and
is invariant.
As f is a diffeomorphism, both f and map the interior of
into itself. Hence the interior of
is invariant. As
is also invariant,
must be invariant.
Lemma 3.3
For any ,
,
and
we have
(17)
(17)
Proof.
Define as follows
If
and
, then we have
Hence
is strictly concave. Similarly
defined by
is also strictly concave. The inequality (Equation17
(17)
(17) ) is now a direct result of the strict concavity of
and
and the following facts:
Lemma 3.4
(a) Let be the set of all points on or under the graph of a continuous strictly decreasing function
. Then for the log-scaled Leslie–Gower map
in (Equation14
(14)
(14) ) we have
where
, and
and H is the invertible continuous function defined by
(b) We have
where h and g are as defined in part (a).
Proof.
(a) For we have
Since B is strictly decreasing, H is strictly decreasing and invertible. Hence,
(b) For
we have
Since
,
is positive. Hence,
and
which implies that the derivative of the function
is always positive. Thus
Combining the previous lemmas together we obtain.
Theorem 3.1
For any r, s>1 and , for the log-scaled Leslie–Gower map (Equation14
(14)
(14) ), the set
defined by (Equation16
(16)
(16) ) is convex and invariant. Moreover,
is invariant and attracts
.
Proof.
It is clear that is convex. We use induction to prove that for
,
is convex, from which it follows that their intersection
is convex. To prove convexity of
, first we observe that by Lemma 3.4(b) for every
we have
Now
and
satisfy the conditions stated for A in Lemma 2.1.
So far, we have proven the existence of A which satisfies the conditions of Lemma 2.1 for . But to apply Lemma 1 we also need to prove the existence of the second function B of that lemma. Indeed it is easy to check that B is given by
. Hence by Lemma 2.1,
is the set of all points on or under the graph of a continuous strictly decreasing function. It is obvious that for every
and
we have
. Moreover by Lemma 3.3 we have
. Therefore, for every
and
there exists
such that
. Now since
satisfies the conditions of Lemma 2.2, we deduce that
is convex.
Assume that for ,
is convex and that it is the set of all points on or under the graph of a continuous strictly decreasing function
. By Lemma 3.4(a), for every
we have
where g, h and K are as defined in Lemma 3.4. The functions
,
and K satisfy the conditions of Lemma 2.3, so that for every
we have
, where
is continuous. Thus
A: = G and
satisfy the conditions stated for A in Lemma 2.1. Owing to the symmetric structure of the definition of the log-scaled Leslie–Gower map we can prove the existence of B which satisfies the conditions of Lemma 2.1 for
. Therefore, Lemma 2.1 shows that
is the set of all points on or under the graph of a continuous strictly decreasing function.
Suppose that . Since the sequence
is decreasing, we have
. Now since
is convex, for every
we have
, thus
. By Lemma 3.3 we have
. Therefore, for every
and
there exists
such that
. Since
satisfies the conditions of Lemma 2.2, we deduce that
is convex. We conclude that
is convex.
is invariant by Lemma 3.2. We know that
is the graph of a concave and strictly decreasing function A. By invariance,
, i.e.
. As
is strictly decreasing and bounded above,
and invariance yields
, so
. A similar argument shows that
.
To show that attracts
, first we show that any finite fixed point of (Equation14
(14)
(14) ) must belong to
. As there can be at most one finite fixed point, if
is a finite fixed point not in
then
contains no finite fixed point and dynamics on
is monotone. On
we may consider the one-dimensional dynamics
or
. Suppose
when
:
so we need
. On the other hand,
so we also need
. The pair of conditions
and
are incompatible with existence of a finite fixed point (Equation15
(15)
(15) ) of (Equation14
(14)
(14) ). A similar contradiction is obtained when the dynamics is monotone increasing in
. Hence we conclude that whenever a finite fixed point exists for (Equation14
(14)
(14) ) it must belong to
.
Next we recall (e.g. [Citation7]) that all non-trivial dynamics for the unscaled Leslie–Gower map converge to a fixed point which can be ,
, or
when it is positive. Hence any orbit of (Equation11
(11)
(11) ) not convergent to the positive fixed point must converge to
or
.
Now consider an orbit of (Equation14
(14)
(14) ) that does not converge to a finite fixed point. Then by convergence of Leslie–Gower orbits,
tends to
or
as
. Suppose
tends to
as
. Then
,
as
. On the other hand,
as
. Thus
as
. Hence in this case we have
as
. The case
tends to
is similar.
Finally for the case that an orbit of (Equation14
(14)
(14) ) converges a positive fixed point P, as we showed in the previous paragraph
.
Thus we conclude that is attracting.
3.2. The Ricker model
The planar Ricker model is defined by the non-invertible map
(18)
(18) where
.
With the coordinates stated in (Equation13(13)
(13) ), we have the following log-scaled version of the model:
(19)
(19) For the time being we work with the Ricker map in these standard coordinates to see when we can expect a carrying simplex to be unique when it exists. Log coordinates will be introduced later. The following points are always fixed points of F:
(20)
(20) When
and
defined in (Equation21
(21)
(21) ) below is a member of
, then F has exactly four fixed points and the fourth fixed point is:
(21)
(21) We will find it more convenient to now use the log-scaled version (Equation19
(19)
(19) ). We define
where
is the third quadrant. We let
and define the sets
(22)
(22)
Lemma 3.5
If s, r<1 then
Proof.
It is obvious that . To prove that we also have
, it is sufficient to prove that for any
, there exists
such that
.
If x>0 then we have
and if y>0 then
Therefore, if we define n as follows,
then
.
Lemma 3.6
When r, s>0 we have .
Proof.
can be found such that for every
the following equations have at least one solution with
:
Hence if then
. Therefore for
we have
and
.
Now we will show that is invariant. Since the log-scaled Ricker map f is not invertible, to show invariance of
we need a property weaker than invertibility. We use the fact that the log-scaled Ricker map f is a proper map (i.e. for every compact set
,
is compact). To see this, note that if
is a sequence such that
, then, according to the terms in (Equation19
(19)
(19) ),
. Since f is continuous, we conclude that for every closed and bounded set X,
is closed and bounded. Therefore, for every compact set X,
is compact and we conclude that the log-scaled Ricker map f is proper.
Lemma 3.7
When 0<r, s<1 and f is the log-scaled Ricker map, defined by (Equation22
(22)
(22) ) is invariant.
Proof.
If then
for
. Hence
and since
, we have
. This proves
.
We prove that for
. It is sufficient to show that
is closed if
is closed. Suppose that
is a limit point of
. There exists a sequence
such that
.
is bounded since, being proper, f maps unbounded subsets of
into unbounded sets whereas
is convergent, and hence bounded. Boundedness of
and the fact that
is closed, imply that
has a limit point
. Continuity of f implies
. Thus
, which proves that
is closed and hence
.
Now if , then
for
. Hence for
there exists
such that
. Since f is proper,
is compact. Therefore, since
,
is bounded and has at least one limit point. Let
be such a limit point.
is also a limit point of
, and since
is closed, we have
. Thus
and since
is a limit point of
, and for
we have
where
is a decreasing sequence of closed sets, we conclude that
. This proves
.
Lemma 3.8
Lemma 3.3 also holds for the log-scaled Ricker map f defined in (Equation19(19)
(19) ).
Proof.
We define and
as follows
It is easy to show that both
and
are strictly concave (being the sum of linear minus exponential terms), and the rest of the proof is straightforward.
Lemma 3.9
(a) Let and
be the set of all points on or under the graph of a continuous strictly decreasing function
. Let
denote the log-scaled Ricker map. Then we have
where
,
is the principal branch of the Lambert W function (see, for example, [Citation16]),
and G is the continuous invertible function defined by
(b) We have
where P is the function defined in part (a) and
Proof.
(a) For we have
When t<0,
is strictly increasing. Hence, for every
,
has at most one solution for
. Since
,
has a unique solution for
and
and no solution when
and l>−1. We claim that
is the unique solution for
when
and
. To prove that, we have
(23)
(23) By the properties of the Lambert W function
we have
. Hence
. This along with (Equation23
(23)
(23) ) implies
(since
must satisfy t<0, only the principal branch of the Lambert W function can be used to provide a solution). Now with
and t = y we have
Since
,
in the above sets, and since when t<0,
is strictly increasing, we have
Thus
(b) For
we have
Lemma 3.10
For any 0<r, s<1 and , and f is the log-scaled Ricker map,
defined in (Equation22
(22)
(22) ) is invariant and convex.
Notice that Lemma 3.10 is not a complete analogue of Theorem 3.1 since we are not claiming that is necessarily invariant. We will address this after proving Lemma 3.10.
Lemma 3.10. Convexity of can be proved with a similar argument to that used for the scaled Leslie–Gower model. So we explain the argument more briefly. It is obvious that
is convex, and by using induction we can prove convexity of
for
, and that implies convexity of
.
To prove convexity of , by Lemma 3.9(b) for
we have
where P, K and
are defined in that part of the lemma. Now it is easy to verify that
and
defined by
and K satisfy the conditions of Lemma 2.3. By Lemma 2.3 for every
we have
, where
is continuous. Thus
Now
satisfy the conditions stated for A in Lemma 2.1.
Owing to the symmetric structure of the definition of the log-scaled Ricker map, we can state similar lemmas to prove that there exists B such that it satisfies the conditions of Lemma 2.1 for . Now since, by Lemma 2.1,
is the set of all points on or under the graph of a continuous strictly decreasing function, we can use Lemma 2.2 and Lemma 3.8 with a similar argument to that used in Theorem 1 to prove that
is convex.
Assume that for ,
is convex and it is the set of all points on or under the graph of a continuous strictly decreasing function
. By Lemma 3.9(a) for every
we have
Then
and
defined by
satisfy the conditions of Lemma 2.3 and G defined in that lemma is continuous. So A: = G and
satisfy the conditions stated for A in Lemma 2.1. Again, owing to the symmetric structure of the definition of the log-scaled Ricker map we can prove the existence of B which satisfies the conditions of Lemma 2.1 for
. Therefore, by that lemma,
is the set of all points on or under the graph of a continuous strictly decreasing function. Now we can use Lemmas 2.2 and 3.8 and a similar argument to that used in Theorem 3.1 to prove that
is convex.
According to Lemma 3.7 is invariant, and as the intersection of convex sets it is convex.
As the log-scaled Ricker map f is not invertible we cannot conclude that is also invariant. In order to prove that
is invariant, it is sufficient to show that the restriction
is invertible. If the Jacobian of f is non-vanishing throughout
then f is locally invertible at any point of
. But as is well known, locally invertibility does not always imply global invertibility. Ho [Citation10] proved that a local homeomorphism between a pathwise connected Hausdorff space and a simply connected Hausdorff space is a global homeomorphism if and only if that map is proper. We have already established that the log-scaled Ricker map f is proper (in the paragraph preceding Lemma 3.7). Hence, if we prove that the Jacobian of f does not vanish anywhere in
for a given range of parameters, then we can deduce that
is invariant for that same range of parameters.
Thus now we consider where the Jacobian vanishes.
Using [Citation6] (which studies the unscaled Ricker map (Equation18(18)
(18) )) the Jacobian of the log-scaled Ricker map f only vanishes on
defined by
(24)
(24) Set
When
, then
if and only if t<0. If
, then
if and only if
. In this case,
is the union of two connected curves. By Lemma 3.5, if r, s<1, then
. So in this case we only need to consider
and investigate whether or not the Jacobian vanishes at some points on
.
According to [Citation6], is bounded by the set of points on or under
defined by
(25)
(25) Since
,
is a subset of the set of points on or under
. Hence, if r, s<1 and
does not intersect that space, then the Jacobian of f does not vanish anywhere in
since
.
Lemma 3.11
If r, s<1 then does not intersect the set of points on or under
. Hence, if r, s<1 then
is invariant.
Proof.
It is sufficient to show that if and
, then
. Since
, for some t<0 we have
. Since
and
, we have
We define
. We have
(26)
(26) It is easy to show that when h<0, then
. We use this fact multiple times in this proof. From t<0 we have
. This along with s<1 and
implies
. Thus
. Now since
, we have
(27)
(27) Now (Equation26
(26)
(26) ) and (Equation27
(27)
(27) ) imply
(28)
(28) For the sake of expressing equations in a simpler way, let
. We have 0<T<1,
and we can rewrite (Equation28
(28)
(28) ) as follows
(29)
(29) We have
(30)
(30) As we mentioned before,
. Hence, from
, we deduce
thus
(31)
(31) From T>0, s<1 and
we have
(32)
(32) Since
for
, we have
(33)
(33) Now (Equation31
(31)
(31) ), (Equation32
(32)
(32) ) and (Equation33
(33)
(33) ) imply
This along with (Equation29
(29)
(29) ) and (Equation30
(30)
(30) ) implies
where
Now by the above inequalities we have
From s<1, r<1,
and 0<T<1 we can deduce that
Therefore,
. Now since
, we deduce that
, which implies
. This proves
. Now since
is a subset of the set of points on or under
,
does not intersect
and by the argument we stated before, we deduce that
is invariant.
We may now put together Lemmas 3.10 and 3.11 to obtain the analogue of Theorem 3.1 for the Ricker map:
Theorem 3.2
For any 0<r, s<1 and and f is the log-scaled Ricker map,
defined in (Equation22
(22)
(22) ) is invariant and convex,
is invariant and attracts
.
Proof.
All that is left to do is show that is attracting. It is proven that if r, s<2, then every non-trivial orbit converges to one of the non-zero fixed points (see [Citation5]). The possible non-zero fixed points on the x or y axis are the same as for the Leslie–Gower model with r−1 replaced by r and s−1 replaced by s. So we may use the same method as used for the log-scaled Leslie–Gower map to show attraction to
.
From this we obtain the following improvement on the known conditions
(e.g. [Citation8,Citation9,Citation17,Citation18]) for the existence of a carrying simplex for the Ricker model. These inequalities fail for some
, when r, s<1, namely those
that satisfy r, s<1 and
. However, Lemma 3.11 also shows that the unscaled Ricker map is retrotone on
when r, s<1 so we obtain
Corollary 3.1
When r, s<1 and the Ricker map
has a (compact) carrying simplex.
Proof.
In the absence of asymptotic completeness in Theorem 3.2, we apply standard results on retrotone systems (e.g. [Citation9,Citation11,Citation17,Citation18]).
Disclosure statement
No potential conflict of interest was reported by the author(s).
References
- S. Baigent, Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems, J. Differ. Eq. Appl. 22(5) (2016), pp. 609–620.
- S. Baigent, Convexity of the carrying simplex for discrete-time planar competitive Kolmogorov systems, J. Differ. Eq. Appl. 22(5) (2016), pp. 1–14.
- S. Baigent, Carrying simplices for competitive maps, in Difference Equations, Discrete Dynamical Systems and Applications. ICDEA 2017, S. Elaydi, C. Pötzsche, and A. Sasu, eds., Springer Proceedings in Mathematics and Statistics, Vol. 287. Springer, Cham.
- S. Baigent, Convex geometry of the carrying simplex for the May–Leonard map, Discrete Contin. Dyn. Syst. B 24(4) (2019), pp. 1697–1723.
- S. Baigent, Z. Hou, S. Elaydi, E.C. Balreira, and R. Luís, A global picture for the planar Ricker map: Convergence to fixed points and identification of the stable/unstable manifolds, J. Differ. Eq. Appl. 29(5) (2023), pp. 575–591.
- E.C. Balreira, S. Elaydi, and R. Luís, Local stability implies global stability for the planar Ricker competition model, Discrete Contin. Dyn. Syst. Ser. B 19(2) (2014), pp. 323–351.
- J.M. Cushing, S. Levarge, N. Chitnis, and S.M. Henson, Some discrete competition models and the competitive exclusion principle, J. Differ. Eq. Appl. 10 (2004), pp. 1139–1151.
- M. Gyllenbeg, J. Jiang , L. Niu, and P. Yan, On the dynamics of multi-species Ricker models admitting a carrying simplex, J. Differ. Eq. Appl. 25(11) (2019), pp. 1489–1530.
- M.W. Hirsch, On existence and uniqueness of the carrying simplex for competitive dynamical systems, J. Biol. Dyn. 2(2) (2008), pp. 169–179.
- C.W. Ho, A note on proper maps, Proc. Am. Math. Soc. 51 (1975), pp. 237–241.
- Z. Hou, On existence and uniqueness of a modified carrying simplex for discrete Kolmogorov systems, J. Differ, Eq. Appl. 27(2) (2021), pp. 284–315.
- J. Jiang and L. Niu, The theorem of the carrying simplex for competitive system defined on the n-rectangle and its application to a three-dimensional system, Int. J. Biomath. 07(06) (2014), pp. 1450063–1450012.
- 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(5) (2016), pp. 1–39.
- U. Krause, Positive Dynamical Systems in Discrete Time: Theory, Models, and Applications, De Gruyter, Germany, 2015.
- P.H. Leslie and J.C. Gower, The properties of a stochastic model for two competing species, Biometrika45(3/4) (1958), pp. 316–330.
- I. Mezo, The Lambert W Function: Its Generalizations and Applications, CRC Press, Oxford, 2022.
- J. Mierczyński and S. Baigent, Existence of the carrying simplex for a retrotone map, J. Differ. Equ. Appl. 10(3) (2024), pp. 287–319. doi:10.1080/10236198.2023.2285394
- A. Ruiz-Herrera, Exclusion and dominance in discrete population models via the carrying simplex, J. Differ. Eq. Appl. 19(1) (2013), pp. 96–113.
- H.L. Smith, Planar competitive and cooperative difference equations, J. Differ. Eq. Appl. 3(5-6) (1998), pp. 335–357.
- H.L. Smith and H.R. Thieme, Dynamical Systems and Population Persistence, Graduate Studies in Mathematics Vol. 118, American Mathematical Society, Providence, RI, 2011.
- M.L. Zeeman, Hopf bifurcations in competitive three dimensional Lotka–Volterra systems, Dyn. Stab. Syst. 8 (1993), pp. 189–217.