On Pseudocomplemented and Stone Ordered Sets

The aim of this paper is to characterize both the pseudocomplemented and Stone ordered sets in a manner similar to that used previously for Boolean and distributive ordered sets. The sublattice G(A) of the Dedekind–Mac Neille completion DM(A) of an ordered set A generated by A is said to be the characteristic lattice of A. We will show that there are distributive pseudocomplemented ordered sets whose characteristic lattices are not pseudocomplemented. We can define a stronger notion of pseudocomplementedness by demanding that both A and G(A) be pseudocomplemented. It turns out that the two concepts are the same for finite and Stone ordered sets.     

On minimizing jumps for ordered sets

An ordered set P is called K-free if it does not contain a four-element subset {a, b, c, d} such that a < b is the only comparability among these elements. In this paper we present a polynomial algorithm to find the jump number of K-free ordered sets.     

Comparability invariance of the fixed point property

We show that the fixed point property is comparability invariant for finite ordered sets; that is, if P and Q are finite ordered sets with isomorphic comparability graphs, then P has the fixed point property if and only if Q does. In the process we give a characterization of comparability invariants which can also be used to give shorter proofs of some known results.     

On the Jump Number of Lexicographic Sums of Ordered Sets

Let Q be the lexicographic sum of finite ordered sets Q _x over a finite ordered set P. For some P we can give a formula for the jump number of Q in terms of the jump numbers of Q _x and P, that is, , where s(X) denotes the jump number of an ordered set X. We first show that where w(X) denotes the width of an ordered set X. Consequently, if P is a Dilworth ordered set, that is, s(P) = w(P)–1, then the formula holds. We also show that it holds again if P is bipartite. Finally, we prove that the lexicographic sum of certain jump-critical ordered sets is also jump-critical.     

Totally ordered sets and the prime spectra of rings

Let T be a totally ordered set and let D(T) denotes the set of all cuts of T. We prove the existence of a discrete valuation domain O_v such that T is order isomorphic to two special subsets of Spec(O_v). We prove that if A is a ring (not necessarily commutative), whose prime spectrum is totally ordered and satisfies (K2), then there exists a totally ordered set U?Spec(A) such that the prime spectrum of A is order isomorphic to D(U). We also present equivalent conditions for a totally ordered set to be a Dedekind totally ordered set. At the end, we present an algebraic geometry point of view.     

On Inverse Transversals of Ordered Regular Semigroups

We first consider an ordered regular semigroup S in which every element has a biggest inverse and determine necessary and sufficient conditions for the subset S ^○ of biggest inverses to be an inverse transversal of S. Such an inverse transversal is necessarily weakly multiplicative. We then investigate principally ordered regular semigroups S with the property that S ^○ is an inverse transversal. In such a semigroup we determine precisely when the set S ^☆ of biggest pre-inverses is a subsemigroup and show that in this case S ^☆ is itself an inverse transversal of a subsemigroup of S. The ordered regular semigroup of 2 × 2 boolean matrices provides an informative illustrative example. The structure of S, when S ^☆ is a group, is also described.     

Designs in Product Association Schemes

A number of important families of association schemes—such as the Hamming and Johnson schemes—enjoy the property that, in each member of the family, Delsarte t-designs can be characterised combinatorially as designs in a certain partially ordered set attached to the scheme. In this paper, we extend this characterisation to designs in a product association scheme each of whose components admits a characterisation of the above type. As a consequence of our main result, we immediately obtain linear programming bounds for a wide variety of combinatorial objects as well as bounds on the size and degree of such designs analogous to Delsarte's bounds for t-designs in Q-polynomial association schemes.     

Shellability of Interval Orders

An finite interval order is a partially ordered set whose elements are in correspondence with a finite set of intervals in the line, with disjoint intervals being ordered by their relative position. We show that any such order is shellable in the sense that its (not necessarily pure) order complex is shellable.     

Unit and Proper Tube Orders

In 2005, we defined the n-tube orders, which are the n-dimensional analogue of interval orders in 1 dimension, and trapezoid orders in 2 dimensions. In this paper we consider two variations of n-tube orders: unit n-tube orders and proper n-tube orders. It has been proven that the classes of unit and proper interval orders are equal, and the classes of unit and proper trapezoid orders are not. We prove that the classes of unit and proper n-tube orders are not equal for all n ≥ 3, so the general case follows the situation in 2 dimensions.     

Note: Semi-Order Dimension Two is a Comparability Invariant

A partial order P =(X, < _P ) is a semi-order if it is an interval order admitting an interval representation such that all the intervals are of unit length. The semi-order dimension of P is the smallest k for which there exist k semi-order extensions of P which realize P. In 1992 the question whether semi-order dimension is a comparability invariant was posed. We prove that for k = 2 this is the case.     

Soft ordered semigroups

Molodtsov introduced 1999 the concept of soft set as a new mathematical tool for dealing with uncertainties that is free from the difficulties that have troubled the usual theoretical approaches. In this paper we apply the notion of soft sets by Molodtsov to ordered semigroups. The notions of (trivial, whole) soft ordered semigroup, soft ordered subsemigroup, soft left (right) ideal, and left (right) idealistic soft ordered semigroup are introduced, and various related properties are investigated (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Linear extensions of orderings

A construction is given which makes it possible to find all linear extensions of a given ordered set and, conversely, to find all orderings on a given set with a prescribed linear extension. Further, dense subsets of ordered sets are studied and a procedure is presented which extends a linear extension constructed on a dense subset to the whole set.     

Trapezoid Order Classification

In this paper we show the nonequivalence of combinations of several natural geometric restrictions on trapezoid representations of trapezoid orders. Each of the properties unit parallelogram, unit trapezoid and proper parallelogram, unit trapezoid and parallelogram, unit trapezoid, proper parallelogram, proper trapezoid and parallelogram, proper trapezoid, parallelogram, and trapezoid is shown to be distinct from each of the others. Additionally, interval orders are shown to be both unit trapezoid and proper parallelogram orders.     

Constructive Order Theory

We introduce the notion of constructive suprema and of constructively directed sets. The Axiom of Choice turns out to be equivalent to the postulate that every supremum is constructive, but also to the hypothesis that every directed set admits a function assigning to each finite subset an upper bound. The Axiom of Multiple Choice (which is known to be weaker than the full Axiom of Choice in set theory without foundation) implies a simple set‐theoretical induction principle (SIP), stating that any system of sets that is closed under unions of well‐ordered subsystems and contains all finite subsets of a given set must also contain that set itself. This is not provable without choice principles but equivalent to the statement that the existence of joins for constructively directed subsets of a poset follows from the existence of joins for nonempty well‐ordered subsets. Moreover, we establish the equivalence of SIP with several other fundamental statements concerning inductivity, compactness, algebraic closure systems, and the exchange between chains and directed sets.     

On monotone permutations of`ℓ-cyclically ordered sets

For an ℓ-cyclically ordered set M with the ℓ-cyclic order C let P(M) be the set of all monotone permutations on M. We define a ternary relation on the set P(M). Further, we define in a natural way a group operation (denoted by ·) on P(M). We prove that if the ℓ-cyclic order C is complete and ≠ 0, then (P(M),·, ) is a half cyclically ordered group.     

Ramsey-Type Results for Unions of Comparability Graphs

 It is well known that the comparability graph of any partially ordered set of n elements contains either a clique or an independent set of size at least . In this note we show that any graph of n vertices which is the union of two comparability graphs on the same vertex set, contains either a clique or an independent set of size at least . On the other hand, there exist such graphs for which the size of any clique or independent set is at most n ^0.4118. Similar results are obtained for graphs which are unions of a fixed number k comparability graphs. We also show that the same bounds hold for unions of perfect graphs. Received: November 1, 1999 Final version received: December 1, 2000     

Some progress on the Aharoni–Korman conjecture

Aharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infinite antichains possesses a chain and a partition into antichains so that each part intersects the chain. Related to both Aharoni's extension of the König duality theorem and Dilworth's theorem, this is an important conjecture in the theory of infinite orders. It is verified for ordered sets of the form C×P, where C is a chain and P is finite, and for ordered sets with no infinite antichains and no infinite intervals.     

半序概率度量空间中φ-μ-混合单调算子方程组的解(英文)

在半序概率度量空间中,引入φ-μ-混合单调算子的概念.同时,构建一些新的条件,并采用半序技巧和分布函数的性质获得了φ-μ-混合单调算子方程组的解.     

Distinguished Completion of a Direct Product of Lattice Ordered Groups

The distinguished completion E(G) of a lattice ordered group G was investigated by Ball [1], [2], [3]. An analogous notion for MV-algebras was dealt with by the author [7]. In the present paper we prove that if a lattice ordered group G is a direct product of lattice ordered groups G _i (i I), then E(G) is a direct product of the lattice ordered groups E(G _i). From this we obtain a generalization of a result of Ball [3].     

Algebras Defined from Ordered Sets and the Varieties they Generate

We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by these algebras. In particular we consider two different but related methods for constructing an algebra with one binary operation from an arbitrary ordered set with a top element. The two varieties generated by all these algebras are shown to be well-behaved in that they are locally finite, finitely based, and have an equationally definable order relation. We exhibit a bijection between the subdirectly irreducible algebras in each variety and the class of all ordered sets with top element. We determine the structure and cardinality of the free algebra on n-free generators and provide sharp bounds on the number of n-generated algebras in each variety. These enumeration results involve the number of quasi-orders on an n-element set.