Displaying 341 – 360 of 1039

Showing per page

Commuting contractive families

Luka Milićević (2015)

Fundamenta Mathematicae

A family f₁,..., fₙ of operators on a complete metric space X is called contractive if there exists a positive λ < 1 such that for any x,y in X we have d ( f i ( x ) , f i ( y ) ) λ d ( x , y ) for some i. Austin conjectured that any commuting contractive family of operators has a common fixed point, and he proved this for the case of two operators. We show that Austin’s conjecture is true for three operators, provided that λ is sufficiently small.

Compatible mappings of type (B) and common fixed point theorems in Saks spaces

H. K. Pathak, M. S. Khan (1999)

Czechoslovak Mathematical Journal

In this paper we first introduce the concept of compatible mappings of type (B) and compare these mappings with compatible mappings and compatible mappings of type (A) in Saks spaces. In the sequel, we derive some relations between these mappings. Secondly, we prove a coincidence point theorem and common fixed point theorem for compatible mappings of type (B) in Saks spaces.

Compatible mappings of type ( β ) and weak compatibility in fuzzy metric spaces

Shobha Jain, Shishir Jain, Lal Bahadur Jain (2009)

Mathematica Bohemica

The object of this paper is to establish a unique common fixed point theorem for six self-mappings satisfying a generalized contractive condition through compatibility of type ( β ) and weak compatibility in a fuzzy metric space. It significantly generalizes the result of Singh and Jain [The Journal of Fuzzy Mathematics ( 2006 ) ] and Sharma [Fuzzy Sets and Systems ( 2002 ) ] . An example has been constructed in support of our main result. All the results presented in this paper are new.

Computing complexity distances between algorithms

Salvador Romaguera, Enrique A. Sánchez-Pérez, Oscar Valero (2003)

Kybernetika

We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which is suitable to give a quantitative measure of the improvement in complexity obtained when a complexity function is replaced by a more efficient complexity function on all inputs, and show that this distance function has the advantage of possessing rich topological and quasi-metric properties. In particular, its induced topology is Hausdorff and completely regular. Our approach is applied to the measurement...

Constant selections and minimax inequalities

Mircea Balaj (2006)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

In this paper, we establish two constant selection theorems for a map whose dual is upper or lower semicontinuous. As applications, matching theorems, analytic alternatives, and minimax inequalities are obtained.

Currently displaying 341 – 360 of 1039