Best proximity point theorems on partially ordered sets

The main purpose of this article is to address a problem that amalgamates approximation and optimization in the setting of a partially ordered set that is endowed with a metric. Indeed, if A and B are non-void subsets of a partially ordered set that is equipped with a metric, and S is a non-self mapping from A to B, this paper scrutinizes the existence of an optimal approximate solution, called a best proximity point of the mapping S, to the operator equation Sx = x where S is a continuous, proximally monotone, ordered proximal contraction. Further, this paper manifests an iterative algorithm for discovering such an optimal approximate solution. As a special case of the result obtained in this article, an interesting fixed point theorem on partially ordered sets is deduced.     

On complete partially ordered sets and compatible topologies

We describe two complete partially ordered sets which are the intersection of complete linear orderings but which have no compatible Hausdorff topology. One is two-dimensional, while the second is countable, and leads to an example of a countable, compact, T ₁ space with a countable base which is not the continuous image of any compact Hausdorff space.     

Multidimensional fixed point theorems in partially ordered complete metric spaces

In this paper we propose a notion of coincidence point between mappings in any number of variables and we prove some existence and uniqueness fixed point theorems for nonlinear mappings verifying different kinds of contractive conditions and defined on partially ordered metric spaces. These theorems extend and clarify very recent results that can be found in [T. Gnana-Bhaskar, V. Lakshmikantham, Fixed point theorems in partially ordered metric spaces and applications, Nonlinear Anal. 65 (7)(2006) 1379–1393], [V. Berinde, M. Borcut, Tripled fixed point theorems for contractive type mappings in partially ordered metric spaces, Nonlinear Anal. 74 (2011) 4889–4897] and [M. Berzig, B. Samet, An extension of coupled fixed point’s concept in higher dimension and applications, Comput. Math. Appl. 63 (8) (2012) 1319–1334].     

Spectral partially ordered sets

We examine some topics related to (gold)spectral partially ordered sets, i.e., those that are order isomorphic to (Goldman) prime spectra of commutative rings. Among other results, we characterize the partially ordered sets that are isomorphic to prime spectra of rings satisfying the descending chain condition on radical ideals, and we show that a dual of a tree is isomorphic to the Goldman prime spectrum of a ring if and only if every chain has an upper bound. We also give some new methods for constructing (gold)spectral partially ordered sets.     

A construction for partially ordered sets

A construction I(S) is defined which corresponds to the intuitive notion of the set of places in which new elements can be inserted into a given poset S. It is given the minimal possible ordering. It turns out that if the base sets are chains the construction produces the corresponding interval orders. for whose dimensions there exist good estimates. In this paper we make the dual restriction that the height of the underlying set is ?1. Under this assumption we find a bound for the dimension of I(S) in general and a precise value if the set consists of two antichains all the elements of one lying above all those of the other.     

Component partially ordered sets

Properties of component partially ordered sets (i.e., dense subsets of Boolean algebras) are used to construct mappings of Boolean algebras generalizing the idea of homomorphisms; the properties of a minimal Boolean algebra generated by a given component partially ordered set are investigated.Translated from Matematicheskie Zametki, Vol. 9, No. 3, pp. 275–283, March, 1971.     

On congruences and ideals of partially ordered quasigroups

Some results concerning congruence relations on partially ordered quasigroups (especially, Riesz quasigroups) and ideals of partially ordered loops are presented. These results generalize the assertions which were proved by Fuchs in [5] for partially ordered groups and Riesz groups.     

Algorithms over partially ordered sets

We here study some problems concerned with the computational analysis of finite partially ordered sets. We begin (in § 1) by showing that the matrix representation of a binary relationR may always be taken in triangular form ifR is a partial ordering. We consider (in § 2) the chain structure in partially ordered sets, answer the combinatorial question of how many maximal chains might exist in a partially ordered set withn elements, and we give an algorithm for enumerating all maximal chains. We give (in § 3) algorithms which decide whether a partially ordered set is a (lower or upper) semi-lattice, and whether a lattice has distributive, modular, and Boolean properties. Finally (in § 4) we give Algol realizations of the various algorithms.     

Countable homogeneous partially ordered sets

It is shown that there are only countably many countable homogeneous partially ordered sets, thereby affirming a conjecture of Henson [2]. A classification of these partially ordered sets is given. Research partially supported by NSF Grant MCS76-07258. Presented by B. Jónsson.     

Quasimartingales on partially ordered sets

The concept of a quasimartingale, and therefore also of a function of bounded variation, is extended to processes with a regular partially ordered index set V and with values in a Banach space. We show that quasimartingales can be described by their associated measures, defined on an inverse limit space $\text{S × Ω}$ containing $\text{V × Ω}$, furnished with the σ-algebra $\text{P}$ of the predictable sets. With the help of this measure, a Rao-Krickeberg and a Riesz decomposition is obtained, as well as a convergence theorem for quasimartingales. For a regular quasimartingale X it is proven that the spaces ($\text{S × Ω}$, $\text{P}$) and the measures associated with X are unique up to isomorphisms. In the case V = $\text{R}$₊ⁿ we prove a duality between classical (right-) quasimartingales and left-quasimartingales.