The set-up we work with here consists of non-empty sets S and X, a mapping f : S × X → X and an element x0 ∈ X. The mapping f will also be regarded as a family of mappings {fs}s∈S, where fs : X → X is given by fs(x) = f(s, x) for all x ∈ X. A subset X ′ of X is said to be f -invariant if f(S ×X ) ⊂ X , i.e., if fs(X ) ⊂ X ′ for each s ∈ S, and the mapping f is said to be minimal if the only f -...

In this note a common fixed point theorem for weakly compatible mappings in a metric space is proved which, improves the results of Ciric [3], Fisher [4], Pant [8],[9] and Popa et al.[10]. Resumen. En esta nota se prueba un teorema de punto fijo común para las funciones débilmente compatibles en un espacio métrico que mejora los resultados de Ciric [3], Fisher [4], Pant [8],[9] y Popa et al.[10].

In this paper, first we prove fixed point theorems for different variant of compatible maps, satisfying a contractive condition of integral type in fuzzy metric spaces, which improve the results of Branciari [2], Rhoades [33], Kumar et al. [23], Subramanyam [35] and results of various authors cited in the literature of ”Fixed Point Theory and Applications”. Secondly, we introduce the notion of ...

In this paper the concept of compatible map in menger space has been applied to prove common fixed point theorem. A fixed point theorem for self maps has been established using the concept of compatibility of pair of self maps.

We establish a common fixed point theorem for two pairs of compatible mappings under a new contractive condition, which is independent of the known contractive definitions. This theorem improves various known results.

Binary-choice reactions are typically faster when the stimulus location corresponds with that of the response than when it does not. This advantage of spatial correspondence is known as the stimulus-response compatibility (SRC) effect when the mapping of stimulus location, as the relevant stimulus dimension, is varied to be compatible or incompatible with response location. It is called the Sim...

Some common fixed point theorems for compatible mappings are shown As an application, the existence and uniqueness of common solutions for a class of functional equations arising in dynamic programmings are discussed.