Natural Partial Orders

1968 ◽  
Vol 20 ◽  
pp. 535-554 ◽  
Author(s):  
R. A. Dean ◽  
Gordon Keller
Keyword(s):  
Partial Orders ◽  
Partial Ordering ◽  
Finite Set ◽  
Partial Orderings

Let n be an ordinal. A partial ordering P of the ordinals T = T(n) = {w: w < n} is called natural if x P y implies x ⩽ y.A natural partial ordering, hereafter abbreviated NPO, of T(n) is thus a coarsening of the natural total ordering of the ordinals. Every partial ordering of a finite set 5 is isomorphic to a natural partial ordering. This is a consequence of the theorem of Szpielrajn (5) which states that every partial ordering of a set may be refined to a total ordering. In this paper we consider only natural partial orderings. In the first section we obtain theorems about the lattice of all NPO's of T(n).

Partial Orders of Similarity Differences Invariant Between EEG-Recorded Brain and Perceptual Representations of Language

2009 ◽  
Vol 21 (11) ◽  
pp. 3228-3269 ◽  
Author(s):  
Patrick Suppes ◽  
Marcos Perreau-Guimaraes ◽  
Dik Kin Wong
Keyword(s):  
Hierarchical Structure ◽  
Partial Orders ◽  
Partial Ordering ◽  
Conditional Probabilities ◽  
Brain Images ◽  
Partial Orderings ◽  
Perceptual Representations ◽  
Confusion Matrices

The idea of a hierarchical structure of language constituents of phonemes, syllables, words, and sentences is robust and widely accepted. Empirical similarity differences at every level of this hierarchy have been analyzed in the form of confusion matrices for many years. By normalizing such data so that differences are represented by conditional probabilities, semiorders of similarity differences can be constructed. The intersection of two such orderings is an invariant partial ordering with respect to the two given orders. These invariant partial orderings, especially between perceptual and brain representations, but also for comparison of brain images of words generated by auditory or visual presentations, are the focus of this letter. Data from four experiments are analyzed, with some success in finding conceptually significant invariants.

CLASSIFICATION OF MULTIVARIATE LIFE DISTRIBUTIONS BASED ON PARTIAL ORDERING

2002 ◽  
Vol 16 (1) ◽  
pp. 129-137 ◽  
Author(s):  
Dilip Roy
Keyword(s):  
Present Article ◽  
Failure Rate ◽  
Partial Ordering ◽  
Increasing Failure Rate ◽  
Multivariate Generalization ◽  
Partial Orderings ◽  
Life Distributions ◽  
New Better Than Used ◽  
Better Than

Barlow and Proschan presented some interesting connections between univariate classifications of life distributions and partial orderings where equivalent definitions for increasing failure rate (IFR), increasing failure rate average (IFRA), and new better than used (NBU) classes were given in terms of convex, star-shaped, and superadditive orderings. Some related results are given by Ross and Shaked and Shanthikumar. The introduction of a multivariate generalization of partial orderings is the object of the present article. Based on that concept of multivariate partial orderings, we also propose multivariate classifications of life distributions and present a study on more IFR-ness.

Partial Orderings of Distributions Based on Right-Spread Functions

1998 ◽  
Vol 35 (1) ◽  
pp. 221-228 ◽  
Author(s):  
J. M. Fernandez-Ponce ◽  
S. C. Kochar ◽  
J. Muñoz-Perez
Keyword(s):  
Probability Distributions ◽  
Partial Ordering ◽  
Dispersion Measure ◽  
Dispersive Ordering ◽  
Partial Orderings

In this paper we introduce a quantile dispersion measure. We use it to characterize different classes of ageing distributions. Based on the quantile dispersion measure, we propose a new partial ordering for comparing the spread or dispersion in two probability distributions. This new partial ordering is weaker than the well known dispersive ordering and it retains most of its interesting properties.

A new ordering for stochastic majorization: theory and applications

1992 ◽  
Vol 24 (03) ◽  
pp. 604-634 ◽  
Author(s):  
Cheng-Shang Chang
Keyword(s):  
Sample Path ◽  
Stochastic Ordering ◽  
Partial Ordering ◽  
Scheduling Problems ◽  
Unified Approach ◽  
Finite Buffers ◽  
Routing And Scheduling ◽  
Partial Orderings ◽  
Stochastic Load ◽  
Stochastic Majorization

In this paper, we develop a unified approach for stochastic load balancing on various multiserver systems. We expand the four partial orderings defined in Marshall and Olkin, by defining a new ordering based on the set of functions that are symmetric, L-subadditive and convex in each variable. This new partial ordering is shown to be equivalent to the previous four orderings for comparing deterministic vectors but differs for random vectors. Sample-path criteria and a probability enumeration method for the new stochastic ordering are established and the ordering is applied to various fork-join queues, routing and scheduling problems. Our results generalize previous work and can be extended to multivariate stochastic majorization which includes tandem queues and queues with finite buffers.

Betweenness relations and cycle-free partial orders

1996 ◽  
Vol 119 (4) ◽  
pp. 631-643 ◽  
Author(s):  
J. K. Truss
Keyword(s):  
Partial Order ◽  
Linear Order ◽  
Partial Orders ◽  
Partial Ordering ◽  
Macneille Completion ◽  
Alternative Definition ◽  
Betweenness Relations

The intuition behind the notion of a cycle-free partial order (CFPO) is that it should be a partial ordering (X, ≤ ) in which for any sequence of points (x0, x1;…, xn–1) with n ≤ 4 such that xi is comparable with xi+1 for each i (indices taken modulo n) there are i and j with j ╪ i, i + 1 such that xj lies between xi and xi+1. As its turn out however this fails to capture the intended class, and a more involved definition, in terms of the ‘Dedekind–MacNeille completion’ of X was given by Warren[5]. An alternative definition involving the idea of a betweenness relation was proposed by P. M. Neumann [1]. It is the purpose of this paper to clarify the connections between these definitions, and indeed between the ideas of semi-linear order (or ‘tree’), CFPO, and the betweenness relations described in [1]. In addition I shall tackle the issue of the axiomatizability of the class of CFPOs.

Some results on the relative ageing of two life distributions

1994 ◽  
Vol 31 (4) ◽  
pp. 991-1003 ◽  
Author(s):  
Debasis Sengupta ◽  
Jayant V. Deshpande
Keyword(s):  
Hazard Ratio ◽  
Partial Ordering ◽  
Closure Properties ◽  
Partial Orderings ◽  
Life Distributions ◽  
Crossing Hazards ◽  
Moment Bounds

Kalashnikov and Rachev (1986) have proposed a partial ordering of life distributions which is equivalent to an increasing hazard ratio, when the ratio exists. This model can represent the phenomenon of crossing hazards, which has received considerable attention in recent years. In this paper we study this and two other models of relative ageing. Their connections with common partial orderings in the reliability literature are discussed. We examine the closure properties of the three orderings under several operations. Finally, we give reliability and moment bounds for a distribution when it is ordered with respect to a known distribution.

scholarly journals Ramsey Properties of Countably Infinite Partial Orderings

10.37236/3151 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Marcia J. Groszek
Keyword(s):  
Natural Number ◽  
Large Class ◽  
Bipartite Graphs ◽  
Partial Ordering ◽  
Partial Orderings ◽  
Countably Infinite

A partial ordering $\mathbb P$ is chain-Ramsey if, for every natural number $n$ and every coloring of the $n$-element chains from $\mathbb P$ in finitely many colors, there is a monochromatic subordering $\mathbb Q$ isomorphic to $\mathbb P$.  Chain-Ramsey partial orderings stratify naturally into levels.  We show that a countably infinite partial ordering with finite levels is chain-Ramsey if and only if it is biembeddable with one of a canonical collection of examples constructed from certain edge-Ramsey families of finite bipartite graphs.  A similar analysis applies to a large class of countably infinite partial orderings with infinite levels.

Partial Orders on the 2-Cell

1975 ◽  
Vol 18 (3) ◽  
pp. 411-416
Author(s):  
E. D. Tymchatyn
Keyword(s):  
Partial Order ◽  
Metric Space ◽  
Closed Subset ◽  
Cartesian Product ◽  
Partial Orders ◽  
Partial Ordering ◽  
Compact Metric Space ◽  
Partially Ordered ◽  
Ordered Space

A partially ordered space is an ordered pair (X, ≤) where X is a compact metric space and ≤ is a partial ordering on X such that ≤ is a closed subset of the Cartesian product X×X. ≤ is said to be a closed partial order on X.

Boundedness Properties in Function-Lattices

1949 ◽  
Vol 1 (2) ◽  
pp. 176-186 ◽  
Author(s):  
M. H. Stone
Keyword(s):  
Topological Space ◽  
Real Number ◽  
Lower Bounds ◽  
Upper Bound ◽  
Number System ◽  
Partial Ordering ◽  
Partially Ordered ◽  
Finite Set ◽  
Real Number System ◽  
Natural Way

The continuous real functions on a topological space X are partially ordered in a natural way by putting ƒ ≦ g if and only if ƒ(x)≦ g(x) for all x in X. With respect to this partial ordering these functions constitute a lattice, the lattice operations ∪ and ∩ being defined by the relations (ƒ ∪ g) (x) = max (ƒ(x), g(x)) ƒ ∩ g )(x) = min (ƒ(x), g(x)). The lattice character of any partially ordered system merely expresses the existence of least upper and greatest lower bounds for any finite set of elements in the system. Many partially ordered systems enjoy much stronger boundedness properties than these: for example, every subset with an upper bound may have a least upper bound, as in the case of the real number system.

0# and some forcing principles

1986 ◽  
Vol 51 (1) ◽  
pp. 39-46 ◽  
Author(s):  
Matthew Foreman ◽  
Menachem Magidor ◽  
Saharon Shelah
Keyword(s):  
Real Number ◽  
Large Cardinals ◽  
Singular Limit ◽  
Partial Ordering ◽  
The Other ◽  
List Type ◽  
Consistency Strength ◽  
Axiom Of Determinacy ◽  
Partial Orderings ◽  
The Universe

It has been considered desirable by many set theorists to find maximality properties which state that the universe has in some sense “many sets”. The properties isolated thus far have tended to be consistent with each other (as far as we know). For example it is a widely held view that the existence of a supercompact cardinal is consistent with the axiom of determinacy holding in L(R). This consistency has been held to be evidence for the truth of these properties. It is with this in mind that the first author suggested the following:Maximality Principle If P is a partial ordering and G ⊆ P is a V-generic ultrafilter then eithera) there is a real number r ∈ V [G] with r ∉ V, orb) there is an ordinal α such that α is a cardinal in V but not in V[G].This maximality principle applied to garden variety partial orderings has startling results for the structure of V.For example, if for some , then P = 〈{p: p ⊆ κ, ∣p∣ < κ}, ⊆〉 neither adds a real nor collapses a cardinal. Thus from the maximality principle we can deduce that the G. C. H. fails everywhere and there are no inaccessible cardinals. (Hence this principle contradicts large cardinals.) Similarly one can show that there are no Suslin trees on any cardinal κ. These consequences help justify the title “maximality principle”.Since the maximality principle implies that the G. C. H. fails at strong singular limit cardinals it has consistency strength at least that of “many large cardinals”. (See [M].) On the other hand it is not known to be consistent, relative to any assumptions.

Sign in / Sign up

Export Citation Format

Share Document