Results 121 to 130 of about 851,942 (152)
Counting Spinal Phylogenetic Networks. [PDF]
Bull Math BiolFrancis A, Hendriksen M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Annals of Mathematics, 1951
where f, p are continuous, g satisfies a Lipschitz condition, p(t) has period 1, and g(t)/I ? 1 for large t at any rate. Our choice of hypotheses and the main lines of our investigations have been dominated by what is significant in the theory of differential equations, but our results are concerned solely with sets of points and transformations of ...
Cartwright, M. L., Littlewood, J. E.
openaire +3 more sources
where f, p are continuous, g satisfies a Lipschitz condition, p(t) has period 1, and g(t)/I ? 1 for large t at any rate. Our choice of hypotheses and the main lines of our investigations have been dominated by what is significant in the theory of differential equations, but our results are concerned solely with sets of points and transformations of ...
Cartwright, M. L., Littlewood, J. E.
openaire +3 more sources
2008
This article gives statements of the Tarski fixed point theorem and the main versions of the topological fixed point principle that have been ...
openaire +2 more sources
This article gives statements of the Tarski fixed point theorem and the main versions of the topological fixed point principle that have been ...
openaire +2 more sources
Subrahmanyam’s fixed point theorem
Nonlinear Analysis: Theory, Methods & Applications, 2009In this paper, a sufficient and necessary condition for the convergence of the sequence of successive \(\{T^n x\}\) approximations to a fixed point of self mapping \(T\) on a complete metric space \((X, d)\) is given. Some equivalent conditions for the convergence of the sequence of successive \(\{T^n x\}\) approximations to a unique fixed point of ...
openaire +2 more sources
1987
An economic system, which consists of a number of relationships among the relevant factors, is modelled as a system of equations or inequalities of certain unknowns, whose solution represents a specific state in which the system settles. This is typically exemplified by the Walrasian competitive economy (Walras, 1874), consisting of the interaction of ...
openaire +1 more source
An economic system, which consists of a number of relationships among the relevant factors, is modelled as a system of equations or inequalities of certain unknowns, whose solution represents a specific state in which the system settles. This is typically exemplified by the Walrasian competitive economy (Walras, 1874), consisting of the interaction of ...
openaire +1 more source
1998
We begin by the well-known Banach contraction principle. A mapping f: X → Y from a metric space (X, ρ ) into a metric space (Y, d) is said to be a contraction if there is a number 0 ≤ γ < 1 such that inequality \( d\left( {f\left( x \right),f\left( {x'} \right)} \right) \leqslant \gamma \cdot \rho \left( {x,x'} \right) \) holds, for every pair of ...
Dušan Repovš +1 more
openaire +1 more source
We begin by the well-known Banach contraction principle. A mapping f: X → Y from a metric space (X, ρ ) into a metric space (Y, d) is said to be a contraction if there is a number 0 ≤ γ < 1 such that inequality \( d\left( {f\left( x \right),f\left( {x'} \right)} \right) \leqslant \gamma \cdot \rho \left( {x,x'} \right) \) holds, for every pair of ...
Dušan Repovš +1 more
openaire +1 more source
Heterogeneous Vectorial Fixed Point Theorems
Mediterranean Journal of Mathematics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tiziana Cardinali +2 more
openaire +2 more sources
1980
In the theory of zero-sum, two-person games the basic theorem was proved by John von Neumann; he used the Brouwer fixed-point theorem. In the theory of many-person games the basic theorem was proved by J. F. Nash; he also used the Brouwer fixed-point theorem. We will prove Nash’s theorem with the Kakutani fixed-point theorem.
openaire +1 more source
In the theory of zero-sum, two-person games the basic theorem was proved by John von Neumann; he used the Brouwer fixed-point theorem. In the theory of many-person games the basic theorem was proved by J. F. Nash; he also used the Brouwer fixed-point theorem. We will prove Nash’s theorem with the Kakutani fixed-point theorem.
openaire +1 more source
2018
In Sect. 5.1, we discuss the Banach’s contraction mapping theorem and some consequences of this theorem. We also deal with contractive mappings considered by Edelstein [212] and certain generalizations of contraction mapping theorem, mainly the ones obtained by Boyd and Wongs [75], Kannan [308, 309], Reich [509] and Husain and Sehgal [283] and others ...
openaire +1 more source
In Sect. 5.1, we discuss the Banach’s contraction mapping theorem and some consequences of this theorem. We also deal with contractive mappings considered by Edelstein [212] and certain generalizations of contraction mapping theorem, mainly the ones obtained by Boyd and Wongs [75], Kannan [308, 309], Reich [509] and Husain and Sehgal [283] and others ...
openaire +1 more source