Results 11 to 20 of about 6,090,423 (307)
On partitions of a partially ordered set [PDF]
Journal of Combinatorial Theory, Series B, 1977 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 +2 more sources
Majorization on a Partially Ordered Set [PDF]
Proceedings of the American Mathematical Society, 1979 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
Shaprly transitive partially ordered sets [PDF]
Discrete Mathematics, 1986 If \(\Lambda\) is a p.o. set, \(A=Aut(\Lambda,\leq)\) will denote its group of automorphisms. If for each \(\lambda_ 1,\lambda_ 2\in \Lambda\) there is a unique \(a\in A\) such that \(\lambda_ 1a=\lambda_ 2\), we say that \(\Lambda\) is sharply transitive. It is easily seen that any sharply transitive p.o. set is connected or has just 2 elements.
Behrendt, Gerhard
openaire +2 more sources
Scott-topology based on transitive binary relation [PDF]
Journal of Mahani Mathematical Research, 2022 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
Continuity in Partially Ordered Sets [PDF]
International Journal of Mathematics and Mathematical Sciences, 2008 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
Spanning retracts of a partially ordered set [PDF]
, 1980 Two general kinds of subsets of a partially ordered set P are always retracts of P: (1) every maximal chain of P is a retract; (2) in P, every isometric, spanning subset of length one with no crowns is a retract.
Duffus, D., Rival, I., Simonovits, M.
core +1 more source
Faces of 2-Dimensional Simplex of Order and Chain Polytopes
Mathematics, 2019 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
Applied General Topology, 2022 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
Some Fixed Point Theorems in Generalized Metric Spaces Endowed with Vector-valued Metrics and Application in Linear and Nonlinear Matrix Equations [PDF]
Sahand Communications in Mathematical Analysis, 2020 Let $mathcal{X}$ be a partially ordered set and $d$ be a generalized metric on $mathcal{X}$. We obtain some results in coupled and coupled coincidence of $g$-monotone functions on $mathcal{X}$, where $g$ is a function from $mathcal{X}$ into itself ...
Hasan Hosseinzadeh
doaj +1 more source
The variety generated by order algebras [PDF]
, 2002 Every ordered set can be considered as an algebra in a natural way. We investigate the variety generated by order algebras. We prove, among other things, that this variety is not finitely based and, although locally finite, it is not contained in any ...
Maróti, Miklós +5 more
core +1 more source