Results 11 to 20 of about 6,955,994 (297)
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.
F. K. Hwang
openaire +2 more sources
Fixed Point Theorems of Set-Valued Mappings in Partially Ordered Hausdorff Topological Spaces [PDF]
In this work, several fixed point theorems of set-valued monotone mappings and set-valued Caristi-type mappings are proved in partially ordered Hausdorff topological spaces, which indeed extend and improve many recent results in the setting of metric ...
Shujun Jiang, Zhilong Li, Shihua Luo
doaj +2 more sources
Set-valued mappings in partially ordered fuzzy metric spaces [PDF]
In this paper, we provide coincidence point and fixed point theorems satisfying an implicit relation, which extends and generalizes the result of Gregori and Sapena, for set-valued mappings in complete partially ordered fuzzy metric spaces. Also we prove
Saadati, R +9 more
core +1 more source
Extensions of a Partially Ordered Set [PDF]
In this thesis we introduce the concept of a dense extension of a partially ordered set and study some of the properties of the resulting class of extensions.
Doctor, Hoshang Pesotan
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
In this paper we study the existence of the fixed points for Hardy-Rogers type mappings with respect to a wt-distance in partially ordered metric spaces.
Reza Babaei +2 more
doaj +1 more source
On partitions of a partially ordered set
AbstractUsing linear programming we prove a generalization of Greene and Kleitman's generalization of Dilworth's theorem on the decomposition of a partially ordered set into chains.
Alan J. Hoffman, D. E. Schwartz
openaire +1 more source
Continuity in Partially Ordered Sets [PDF]
The notion of a continuous domain is generalized to include posets which are not dcpos and in which the set of elements way below an element is not necessarily directed. We show that several of the pleasing algebraic and topological properties of domains carry over to this setting.
openaire +3 more sources
Cardinality-restricted Chains and Antichains in Partially Ordered Sets
Cardinality-restricted Chains and Antichains in Partially Ordered ...
Trotter, L. E., Shum, H., Jr
core +5 more sources
Selfduality of the system of convex subsets of a partially ordered set [PDF]
summary:For a partially ordered set $P$ let us denote by $Co P$ the system of all convex subsets of $P$. It is found the necessary and sufficient condition (concerning $P$) under which $Co P$ (as a partially ordered set) is ...
Zelina, Miron
core +1 more source

