Representations of finite partially ordered sets over commutative artinian uniserial rings

Categories of representations of finite partially ordered sets over commutative artinian uniserial rings arise naturally from categories of lattices over orders and abelian groups. By a series of functorial reductions and a combinatorial analysis, the representation type of a category of representations of a finite partially ordered set S over a commutative artinian uniserial ring R is characterized in terms of S and the index of nilpotency of the Jacobson radical of R. These reductions induce isomorphisms of Auslander-Reiten quivers and preserve and reflect Auslander-Reiten sequences. Included, as an application, is the completion of a partial characterization of representation type of a category of representations arising from pairs of finite rank completely decomposable abelian groups.     

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.     

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.     

Representation of partially ordered sets

It is well known [1] that any distributive poset (short for partially ordered set) has an isomorphic representation as a poset (Q, (–) such that the supremum and the infimum of any finite setF ofp correspond, respectively, to the union and intersection of the images of the elements ofF. Here necessary and sufficient conditions are given for similar isomorphic representation of a poset where however the supremum and infimum of also infinite subsetsI correspond to the union and intersection of images of elements ofI. Presented by R. Freese.     

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.     

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.     

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.     

Arithmetic progressions in partially ordered sets

Van der Waerden's arithmetic sequence theorem—in particular, the density version of Szemerédi—is generalized to partially ordered sets in the following manner. Let w and t be fixed positive integers and >0. Then for every sufficiently large partially ordered set P of width at most w, every subset S of P satisfying |S||P| contains a chain a ₁, a ₂,..., a ₁ such that the cardinality of the interval [a _i, a _i+1] in P is the same for each i.Research supported by NSF grant DMS 8401281.Research supported by ONR grant N00014-85-K-0769.