Displaying 241 – 260 of 1039

Showing per page

Coincidence point theorems in certain topological spaces

Jong Soo Jung, Yeol Je Cho, Shin Min Kang, Yong Kab Choi, Byung Soo Lee (1999)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

In this paper, we establish some new versions of coincidence point theorems for single-valued and multi-valued mappings in F-type topological space. As applications, we utilize our main theorems to prove coincidence point theorems and fixed point theorems for single-valued and multi-valued mappings in fuzzy metric spaces and probabilistic metric spaces.

Coincidence points and maximal elements of multifunctions on convex spaces

Sehie Park (1995)

Commentationes Mathematicae Universitatis Carolinae

Generalized and unified versions of coincidence or maximal element theorems of Fan, Yannelis and Prabhakar, Ha, Sessa, Tarafdar, Rim and Kim, Mehta and Sessa, Kim and Tan are obtained. Our arguments are based on our recent works on a broad class of multifunctions containing composites of acyclic maps defined on convex subsets of Hausdorff topological vector spaces.

Coincidence points and R -weakly commuting maps

Naseer Shahzad, Tayyab Kamran (2001)

Archivum Mathematicum

In this paper we extend the concept of R -weak commutativity to the setting of single-valued and multivalued mappings. We also establish a coincidence theorem for pairs of R -weakly commuting single-valued and multivalued mappings satisfying a contractive type condition.

Coincidence theorems for set-valued maps with g-kkm property on generalized convex space

Lai-Jiu Lin, Ching-Jung Ko, Sehie Park (1998)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

In this paper, a set-valued mapping with G-KKM property is defined and a generalization of minimax theorem for set-valued maps with G-KKM property on generalized convex space is established. As a consequence of this results we verify the coincidence theorem for set-valued maps with G-KKM property on G-convex space. Finally, we apply our results to the best approximation problem and fixed point problem.

Combinatorial lemmas for polyhedrons

Adam Idzik, Konstanty Junosza-Szaniawski (2005)

Discussiones Mathematicae Graph Theory

We formulate general boundary conditions for a labelling to assure the existence of a balanced n-simplex in a triangulated polyhedron. Furthermore we prove a Knaster-Kuratowski-Mazurkiewicz type theorem for polyhedrons and generalize some theorems of Ichiishi and Idzik. We also formulate a necessary condition for a continuous function defined on a polyhedron to be an onto function.

Combinatorial lemmas for polyhedrons I

Adam Idzik, Konstanty Junosza-Szaniawski (2006)

Discussiones Mathematicae Graph Theory

We formulate general boundary conditions for a labelling of vertices of a triangulation of a polyhedron by vectors to assure the existence of a balanced simplex. The condition is not for each vertex separately, but for a set of vertices of each boundary simplex. This allows us to formulate a theorem, which is more general than the Sperner lemma and theorems of Shapley; Idzik and Junosza-Szaniawski; van der Laan, Talman and Yang. A generalization of the Poincaré-Miranda theorem is also derived.

Currently displaying 241 – 260 of 1039