Results 21 to 30 of about 665,193 (301)
The motivation of the present paper is to introduce and establish some new fixed point results for monotone multivalued functions in partially ordered complete D ∗ $D^{*}$ -metric spaces, where the partial ordered set ( X , ≤ ) $(X,\leq )$ is obtained ...
Nassar Aiman Majid +3 more
doaj +1 more source
Coincidence of Fixed Points with Mixed Monotone Property
The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance ...
Amal M. Hashim, Ali A. Kazem
doaj +1 more source
Faces of 2-Dimensional Simplex of Order and Chain Polytopes
Each of the descriptions of vertices, edges, and facets of the order and chain polytope of a finite partially ordered set are well known. In this paper, we give an explicit description of faces of 2-dimensional simplex in terms of vertices.
Aki Mori
doaj +1 more source
Best proximity point results with their consequences and applications
In the commenced work, we establish some best proximity point results for multivalued generalized contractions on partially ordered complete metric spaces along with the tactic of altering distance function.
Satyendra Kumar Jain +3 more
doaj +1 more source
Quasi-hereditary twisted category algebras [PDF]
We give a sufficient criterion for when a twisted finite category algebra over a field is quasi-hereditary, in terms of the partially ordered set of L-classes in the morphism set of the category.
Graham +15 more
core +1 more source
An Efficient Algorithm for Decomposition of Partially Ordered Sets
Efficient time complexities for partial ordered sets or posets are well-researched field. Hopcroft and Karp introduced an algorithm that solves the minimal chain decomposition in O (n2.5) time. Felsner et al.
Elsayed Badr +3 more
doaj +1 more source
Majorization on a Partially Ordered Set [PDF]
We extend the classical concept of set majorization to the case where the set is partially ordered. We give a useful property which characterizes majorization on a partially ordered set. Quite unexpectedly, the proof of this property relies on a theorem of Shapley on convex games.
openaire +2 more sources
Ordered Information Systems and Graph Granulation [PDF]
The concept of an Information System, as used in Rough Set theory, is extended to the case of a partially ordered universe equipped with a set of order preserving attributes. These information systems give rise to partitions of the universe where the set
A Skowron +16 more
core +1 more source
In this paper, we discuss fixed point theorems for a new χ-set contraction condition in partially ordered Banach spaces, whose positive cone K $\mathbb{K}$ is normal, and then proceed to prove some coupled fixed point theorems in partially ordered Banach
Hemant Kumar Nashine +3 more
doaj +1 more source
The partially pre-ordered set of compactifications of Cp(X, Y)
In the set of compactifications of X we consider the partial pre-order defined by (W, h) ≤X (Z, g) if there is a continuous function f : Z ⇢ W, such that (f ∘ g)(x) = h(x) for every x ∈ X. Two elements (W, h) and (Z, g) of K(X) are equivalent, (W, h) ≡X (
Dorantes-Aldama A. +2 more
doaj +1 more source

