Results 21 to 30 of about 6,090,423 (307)
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
The symmetric monoidal closed category of cpo $M$-sets [PDF]
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
Halimeh Moghbeli
doaj +1 more source
Pattern classes of permutations via bijections between linearly ordered sets [PDF]
A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e.
Ruškuc, Nik +2 more
core +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
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
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
Finding a Maximum-Weight Convex Set in a Chordal Graph
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of all chordless
Jean Cardinal +2 more
doaj +1 more source
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
Partially homogeneous partially ordered sets
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Saracino, Carol Wood
openaire +2 more sources
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

