نتایج جستجو برای: coupled coincidence point
تعداد نتایج: 726356 فیلتر نتایج به سال:
In this paper we introduce various notions of continuous fuzzy proper functions by using the existing notions of fuzzy closure and fuzzy interior operators like Rτ -closure, Rτ -interior, etc., and present all possible relations among these types of continuities. Next, we introduce the concepts of α-quasi-coincidence, qα r -pre-neighborhood, qα r -pre-closure and qα r pre-continuous function in...
We consider symmetric multivalued vector quasiequilibrium problems in topological vector spaces. Sufficient conditions for the solution existence are established under relaxed assumptions, which are shown by examples to be essential, easy to check and more advantageous than recent known results. Applications to lower and upper bounded quasiequilibrium problems and to coincidence point problems ...
Let (φ, ψ) be an (m,n)-valued pair of maps φ, ψ : X ( Y , where φ is an m-valued map and ψ is n-valued, on connected finite polyhedra. A point x ∈ X is a coincidence point of φ and ψ if φ(x) ∩ ψ(x) 6= ∅. We define a Nielsen coincidence number N(φ : ψ) which is a lower bound for the number of coincidence points of all (m,n)-valued pairs of maps homotopic to (φ, ψ). We calculate N(φ : ψ) for all ...
One challenging problem that children overcome in learning new words is recognizing the hierarchical category of a label. For instance, one object could be called a Dalmatian, a dog, or an animal. Xu and Tenenbaum (2007) proposed a Bayesian model to explain how 3.5 to 5-year-olds solve this ambiguity. They emphasized children's appreciation for “suspicious coincidences:” a label applied to thre...
The purpose of this paper is to present some coincidence point and common fixed point theorems for multivalued contraction maps in complete fuzzy metric spaces endowed with a partial order. As an application, we give an existence theorem of solution for general classes of integral inclusions by the coincidence point theorem.
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the number of iterations needed. The main tool is a simple algorithm for computing modular coincidences, which is essentially a generalization of Dekking coincidence t...
In this paper, we prove coupled coincidence points and common fixed points theorem for two mappings satisfying various contractive conditions in partially ordered metric spaces. Our results will generalize and extend some recent results in fixed point theory.
Suppose X is a partially ordered real Banach space such that there is a 2−norm on X. The purpose of this paper is to prove coupled coincidence and coupled common fixed point theorems for mappings from X ×X to X.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید