scholarly journals Some Characterizations and Properties of a New Partial Order

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Xiaoji Liu ◽  
Fang Gui

On the basis of Löwner partial order and core partial order, we introduce a new partial order: LC partial order. By applying matrix decomposition, core inverse, core partial order, and Löwner partial order, we give some characteristics of LC partial order, study the relationship between LC partial order and Löwner partial order under constraint conditions, and illustrate its differences with some classical partial orders, such as minus, CL, and GL partial orders.

1983 ◽  
Vol 48 (4) ◽  
pp. 1046-1052 ◽  
Author(s):  
Dan Velleman

It is well known that many statements provable from combinatorial principles true in the constructible universe L can also be shown to be consistent with ZFC by forcing. Recent work by Shelah and Stanley [4] and the author [5] has clarified the relationship between the axiom of constructibility and forcing by providing Martin's Axiom-type forcing axioms equivalent to ◊ and the existence of morasses. In this paper we continue this line of research by providing a forcing axiom equivalent to □κ. The forcing axiom generalizes easily to inaccessible, non-Mahlo cardinals, and provides the motivation for a corresponding generalization of □κ.In order to state our forcing axiom, we will need to define a strategic closure condition for partial orders. Suppose P = 〈P, ≤〉 is a partial order. For each ordinal α we will consider a game played by two players, Good and Bad. The players choose, in order, the terms in a descending sequence of conditions 〈pβ∣β < α〉 Good chooses all terms pβ for limit β, and Bad chooses all the others. Bad wins if for some limit β<α, Good is unable to move at stage β because 〈pγ∣γ < β〉 has no lower bound. Otherwise, Good wins. Of course, we will be rooting for Good.


2014 ◽  
Vol 91 (1) ◽  
pp. 104-115 ◽  
Author(s):  
SUREEPORN CHAOPRAKNOI ◽  
TEERAPHONG PHONGPATTANACHAROEN ◽  
PONGSAN PRAKITSRI

AbstractHiggins [‘The Mitsch order on a semigroup’, Semigroup Forum 49 (1994), 261–266] showed that the natural partial orders on a semigroup and its regular subsemigroups coincide. This is why we are interested in the study of the natural partial order on nonregular semigroups. Of particular interest are the nonregular semigroups of linear transformations with lower bounds on the nullity or the co-rank. In this paper, we determine when they exist, characterise the natural partial order on these nonregular semigroups and consider questions of compatibility, minimality and maximality. In addition, we provide many examples associated with our results.


2019 ◽  
Vol 19 (01) ◽  
pp. 2050011 ◽  
Author(s):  
B. Ungor ◽  
S. Halicioglu ◽  
A. Harmanci ◽  
J. Marovt

Let [Formula: see text] be a ring. Motivated by a generalization of a well-known minus partial order to Rickart rings, we introduce a new relation on the power set [Formula: see text] of [Formula: see text] and show that this relation, which we call “the minus order on [Formula: see text]”, is a partial order when [Formula: see text] is a Baer ring. We similarly introduce and study properties of the star, the left-star, and the right-star partial orders on the power sets of Baer ∗-rings. We show that some ideals generated by projections of a von Neumann regular and Baer ∗-ring [Formula: see text] form a lattice with respect to the star partial order on [Formula: see text]. As a particular case, we present characterizations of these orders on the power set of [Formula: see text], the algebra of all bounded linear operators on a Hilbert space [Formula: see text].


Author(s):  
Muhammad Rashad ◽  
Imtiaz Ahmad ◽  
Faruk Karaaslan

A magma S that meets the identity, xy·z = zy·x, ∀x, y, z ∈ S is called an AG-groupoid. An AG-groupoid S gratifying the paramedial law: uv · wx = xv · wu, ∀ u, v, w, x ∈ S is called a paramedial AGgroupoid. Every AG-grouoid with a left identity is paramedial. We extend the concept of inverse AG-groupoid [4, 7] to paramedial AG-groupoid and investigate various of its properties. We prove that inverses of elements in an inverse paramedial AG-groupoid are unique. Further, we initiate and investigate the notions of congruences, partial order and compatible partial orders for inverse paramedial AG-groupoid and strengthen this idea further to a completely inverse paramedial AG-groupoid. Furthermore, we introduce and characterize some congruences on completely inverse paramedial AG-groupoids and introduce and characterize the concept of separative and completely separative ordered, normal sub-groupoid, pseudo normal congruence pair, and normal congruence pair for the class of completely inverse paramedial AG-groupoids. We also provide a variety of examples and counterexamples for justification of the produced results.


2020 ◽  
Vol 10 (2) ◽  
pp. 499 ◽  
Author(s):  
Fabrizio Smeraldi ◽  
Francesco Bianconi ◽  
Antonio Fernández ◽  
Elena González

Partial orders are the natural mathematical structure for comparing multivariate data that, like colours, lack a natural order. We introduce a novel, general approach to defining rank features in colour spaces based on partial orders, and show that it is possible to generalise existing rank based descriptors by replacing the order relation over intensity values by suitable partial orders in colour space. In particular, we extend a classical descriptor (the Texture Spectrum) to work with partial orders. The effectiveness of the generalised descriptor is demonstrated through a set of image classification experiments on 10 datasets of colour texture images. The results show that the partial-order version in colour space outperforms the grey-scale classic descriptor while maintaining the same number of features.


1996 ◽  
Vol 119 (4) ◽  
pp. 631-643 ◽  
Author(s):  
J. K. Truss

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.


Filomat ◽  
2017 ◽  
Vol 31 (18) ◽  
pp. 5695-5701 ◽  
Author(s):  
Xiaoxiang Zhang ◽  
Sanzhang Xu ◽  
Jianlong Chen

Let R be a unital ring with involution. Several characterizations and properties of core partial order in R are given. In particular, we investigate the reverse order law (ab)# = b#a# for two core invertible elements a, b ? R. Some relationships between core partial order and other partial orders are obtained.


Author(s):  
DIJANA MOSIĆ

We define extensions of the weighted core–EP inverse and weighted core–EP pre-orders of bounded linear operators on Hilbert spaces to elements of a $C^{\ast }$ -algebra. Some properties of the weighted core–EP inverse and weighted core–EP pre-orders are generalized and some new ones are proved. Using the weighted element, the weighted core–EP pre-order, the minus partial order and the star partial order of certain elements, new weighted pre-orders are presented on the set of all $wg$ -Drazin invertible elements of a $C^{\ast }$ -algebra. Applying these results, we introduce and characterize new partial orders which extend the core–EP pre-order to a partial order.


1978 ◽  
Vol 25 (2) ◽  
pp. 241-249 ◽  
Author(s):  
K. B. Prabhakara Rao

AbstractAn attempt is made to extend the theory of extensions of partial orders in groups to strict partially ordered N-groups. Necessary and sufficient conditions, for a strict partial order of an N-group to have a strict full extension, and for a strict partial order of an N-group to be an intersection of strict full orders, are obtained when the partially ordered near-ring N and the N-group G satisfy the condition (− x) n = − xn for all elements x in G and positive elements n in N.


1996 ◽  
Vol 48 (5) ◽  
pp. 1091-1120 ◽  
Author(s):  
A. Skowroński ◽  
G. Zwara

AbstractLet A be a finite dimensional associative K-algebra with an identity over an algebraically closed field K, d a natural number, and modA(d) the affine variety of d-dimensional A-modules. The general linear group Gld(K) acts on modA(d) by conjugation, and the orbits correspond to the isomorphism classes of d-dimensional modules. For M and N in modA(d), N is called a degeneration of M, if TV belongs to the closure of the orbit of M. This defines a partial order ≤deg on modA(d). There has been a work [1], [10], [11], [21] connecting ≤deg with other partial orders ≤ext and ≤deg on modA(d) defined in terms of extensions and homomorphisms. In particular, it is known that these partial orders coincide in the case A is representation-finite and its Auslander-Reiten quiver is directed. We study degenerations of modules from the additive categories given by connected components of the Auslander-Reiten quiver of A having oriented cycles. We show that the partial orders ≤ext, ≤deg and < coincide on modules from the additive categories of quasi-tubes [24], and describe minimal degenerations of such modules. Moreover, we show that M ≤degN does not imply M ≤ext N for some indecomposable modules M and N lying in coils in the sense of [4].


Sign in / Sign up

Export Citation Format

Share Document