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.     

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.     

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.     

Quasivarieties generated by partially commutative groups

We prove that a partially commutative metabelian group is a subgroup in a direct product of torsion-free abelian groups and metabelian products of torsion-free abelian groups. From this we deduce that all partially commutative metabelian (nonabelian) groups generate the same quasivariety and prevariety. On the contrary, there exists an infinite chain of different quasivarieties generated by partially commutative groups with defining graphs of diameter 2.     

Control of partially observed diffusions

The optimal control of a partially observed diffusion is discussed when the control parameter is present in both the drift and diffusion coefficients. Using a differentiation result of Blagovescenskii and Freidlin, and adapting techniques of Bensoussan, we obtain a stochastic minimum principle.This research was partially supported by NSERC Grant A7964, by the US Air Force Office of Scientific Research Contract AFOSR-86-0332, and by the US Army Research Office Contract DAAL03-87-K-0102.     

EXISTENCE OF OPTIMAL STRONG PARTIALLY BALANCED DESIGNS

A strong partially balanced design SPBD（v, b, k; λ,0） whose b is the maximum number of blocks in all SPBD（v, b, k; λ, 0）, as an optimal strong partially balanced design, briefly OSPBD（v, k, λ） is studied. In investigation of authentication codes it has been found that the strong partially balanced design can be used to construct authentication codes. This note investigates the existence of optimal strong partially balanced design OSPBD（v, k, 1） for k = 3 and 4, and shows that there exists an OSPBD（v, k, 1） for any v ≥ k.     

Extensions of partially ordered partial abelian monoids

The notion of a partially ordered partial abelian monoid is introduced and extensions of partially ordered abelian monoids by partially ordered abelian groups are studied. Conditions for the extensions to exist are found. The cases when both the above mentioned structures have the Riesz decomposition property, or are lattice ordered, are treated. Some applications to effect algebras and MV-algebras are shown.     

Compression of partially defined information

For partially defined (fuzzy) data we investigate the optimal coding that permits reconstructing some crispification of the data from the code. The combinatorial entropy is obtained for the class of partially defined sequences with given parameters and a coding theorem is proved for fuzzy information sources. The properties of the corresponding entropy are studied and compared with the properties of Shannon entropy. __________ Translated from Nelineinaya Dinamika i Upravlenie, No. 4, pp. 377–396, 2004.     

Precoherent quantale completions of partially ordered semigroups

Just as complete lattices can be viewed as the completions of posets, quantales can also be treated as the completions of partially ordered semigroups. Motivated by the study on the well-known Frink completions of posets, it is natural to consider the “Frink” completions for the case of partially ordered semigroups. For this purpose, we firstly introduce the notion of precoherent quantale completions of partially ordered semigroups, and construct the concrete forms of three types of precoherent quantale completions of a partially ordered semigroup. Moreover, we obtain a sufficient and necessary condition of the Frink completion on a partially ordered semigroup being a precoherent quantale completion. Finally, we investigate the injectivity in the category $$\mathbf {APoSgr}_{\le }$$ of algebraic partially ordered semigroups and their submultiplicative directed-supremum-preserving maps, and show that the $$\mathscr {E}_{\le }$$-injective objects of algebraic partially ordered semigroups are precisely the precoherent quantales, here $$\mathscr {E}_{\le }$$ denote the class of morphisms $$h:A\longrightarrow B$$ that preserve the compact elements and satisfy that $$h(a_1)\cdots h(a_n)\le h(b)$$ always implies $$a_1\cdots a_n\le b$$.     

New partially hyperbolic dynamical systems I

We propose a new method for constructing partially hyperbolic diffeomorphisms on closed manifolds. As a demonstration of the method we show that there are simply connected closed manifolds that support partially hyperbolic diffeomorphisms. Laying aside many surgery constructions of 3-dimensional Anosov flows, these are the first new examples of manifolds which admit partially hyperbolic diffeomorphisms in the past forty years.     

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.     

Monotone generalized contractions in partially ordered probabilistic metric spaces

In this paper, a concept of monotone generalized contraction in partially ordered probabilistic metric spaces is introduced and some fixed and common fixed point theorems are proved. Presented theorems extend the results in partially ordered metric spaces of Nieto and Rodriguez-Lopez [Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations, Order 22 (2005) 223-239; Existence and uniqueness of fixed point in partially ordered sets and applications to ordinary differential equations, Acta Math. Sin. (Engl. Ser.) 23 (2007) 2205-2212], Ran and Reurings [A fixed point theorem in partially ordered sets and some applications to matrix equations, Proc. Amer. Math. Soc. 132 (2004) 1435-1443] to a more general class of contractive type mappings in partially ordered probabilistic metric spaces and include several recent developments.     

Universal theories for partially commutative metabelian groups

We look at properties of partially commutative metabelian groups and of their universal theories. In particular, it is shown that two partially commutative metabelian groups defined by cycles are universally equivalent if and only if the cycles are isomorphic.     

Discrete optimization in partially ordered sets

The primary aim of this article is to resolve a global optimization problem in the setting of a partially ordered set that is equipped with a metric. Indeed, given non-empty subsets A and B of a partially ordered set that is endowed with a metric, and a non-self mapping ${S : A \longrightarrow B}$ , this paper discusses the existence of an optimal approximate solution, designated as a best proximity point of the mapping S, to the equation Sx?=?x, where S is a proximally increasing, ordered proximal contraction. An algorithm for determining such an optimal approximate solution is furnished. Further, the result established in this paper realizes an interesting fixed point theorem in the setting of partially ordered set as a special case.     

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.     

A logic of soft constraints based on partially ordered preferences

Representing and reasoning with an agent’s preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One class of soft constraints formalisms, semiring-based CSPs, allows a partially ordered set of preference degrees, but this set must form a distributive lattice; whilst this is convenient computationally, it considerably restricts the representational power. This paper constructs a logic of soft constraints where it is only assumed that the set of preference degrees is a partially ordered set, with a maximum element 1 and a minimum element 0. When the partially ordered set is a distributive lattice, this reduces to the idempotent semiring-based CSP approach, and the lattice operations can be used to define a sound and complete proof theory. A generalised possibilistic logic, based on partially ordered values of possibility, is also constructed, and shown to be formally very strongly related to the logic of soft constraints. It is shown how the machinery that exists for the distributive lattice case can be used to perform sound and complete deduction, using a compact embedding of the partially ordered set in a distributive lattice.     

Butson Hadamard matrices with partially cyclic core

In this paper, we introduce a class of generalized Hadamard matrices, called a Butson Hadamard matrix with partially cyclic core. Then a new construction method for Butson Hadamard matrices with partially cyclic core is proposed. The proposed matrices are constructed from the optimal balanced low-correlation zone(LCZ) sequence set which has correlation value ?1 within LCZ.     

On free partially associative triple systems

A triple system is partially associative (by definition) if it satisfies the identity (abc)de + a(bcd)e + ab(cde) ≡ 0. This paper presents a computational study of the free partially associative triple system on one generator with coefficients in the ring Z of integers. In particular, the Z-module structure of the homogeneous submodules of (odd) degrees ≤ 11 is determined, together with explicit generators for the free and torsion components in degrees ≤ 9. Elements of additive order 2 exist in degrees ≥ 7, and elements of additive order 6 exist in degrees ≥ 9. The most difficult case (degree 11) requires finding the row-reduced form over Z of a matrix of size 364 × 273. These computations were done with Maple V.4 on a Sun workstation.