New Results for Weakly Compatible (<i<WC</i<) and <i<R</i<-Weakly Commuting (<i<RWC</i<) Mappings with an Applicationin Dynamic Programming

The aim of this paper is to obtain some new results about common fixed points. Our results use weaker conditions than those previously used. We have relaxed the conditions for commutating pair mappings and compatible mappings of the type <inline-formula<<math xmlns="http://www.w3.org/1...
Ausführliche Beschreibung

The aim of this paper is to obtain some new results about common fixed points. Our results use weaker conditions than those previously used. We have relaxed the conditions for commutating pair mappings and compatible mappings of the type <inline-formula<<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"<<semantics<<mrow<<mo<(</mo<<mi<A</mi<<mo<)</mo<</mrow<</semantics<</math<</inline-formula<, which were introduced in 1976. The theorems are enriched by using the concept of <inline-formula<<math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"<<semantics<<mrow<<mi<W</mi<<mi<C</mi<</mrow<</semantics<</math<</inline-formula< and various types of weakly commuting pairs of maps in metric spaces. To discuss the existence and uniqueness of the common solutions, we have obtained an application to the functional equations in dynamic programming. Ausführliche Beschreibung