Results 21 to 30 of about 45,393 (304)
Some Common Fixed Point Theorems in Partially Ordered Sets
The purpose of this paper is to prove some new fixed point theorem and common fixed point theorems of a commuting family of order-preserving mappings defined on an ordered set, which unify and generalize some relevant fixed point theorems.
Khadija Bouzkoura, Said Benkaddour
doaj +1 more source
Order-Sensitive Domination in Partially Ordered Sets and Graphs [PDF]
For a (finite) partially ordered set (poset) P, we call a dominating set D in the comparability graph of P, an order-sensitive dominating set in P if either x is an element of D or else a = 2, we associate to G a graded poset P-k(G) of height k, and ...
Mehmet Akif Yetim +5 more
core +1 more source
Visualizing Partially Ordered Sets for Socioeconomic Analysis
In this paper, we develop a visualization process for partial orders derived from considering many numerical indicators on a statistical population. The issue is relevant, particularly in the field of socio-economic evaluation, where explicitly taking ...
MARCO FATTORE +2 more
doaj +1 more source
Representations of bornologies
Bornologies abstract the properties of bounded sets of a metric space. But there are unbounded bornologies on a metric space like $\mathcal{P}(\RR)$ with the Euclidean metric.
Homeira Pajoohesh
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
Scott-topology based on transitive binary relation [PDF]
In the study of partially ordered sets, topologies such as Scott-topology have shown to be of paramount importance. In order to have analogous topology-like tools in the more general setting of quantitative domains, we introduce a method to construct ...
Osama Sayed, Nabil Hassan Sayed
doaj +1 more source
Word posets, with applications to Coxeter groups [PDF]
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete.
Matthew J. Samuel
doaj +1 more source
Constant Rate Distributions on Partially Ordered Sets
We consider probability distributions with constant rate on partially ordered sets, generalizing distributions in the usual reliability setting ([0,∞),≤) that have constant failure rate.
Kyle Siegrist
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
Fixed point results and their applications to Markov processes
New existence and comparison results are proved for fixed points of increasing operators and for common fixed points of operator families in partially ordered sets.
S. Heikkilä
doaj +2 more sources

