Fixed points of posets and clique graphs

The fixed point property for partial orders has been the object of much attention in the past twenty years. Recently, M. Roddy ([7]) proved this famous conjecture of Rival (see [6]): the class of finite orders with the fixed point property is closed under finite products.In this article, we prove that a finite order has the fixed point property if the sequence of iterated clique graphs of its comparability graph tends to the trivial graph.     

A Ramsey theorem for multiposets

In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result from the 1980s claims that the class of all finite posets with a linear extension has the Ramsey property. In 2010 Sokić proved that the class of all finite structures consisting of several linear orders has the Ramsey property. This was followed by a 2017 result of Solecki and Zhao that the class of all finite posets with several linear extensions has the Ramsey property.Using the categorical reinterpretation of the Ramsey property in this paper we prove a common generalization of all these results. We consider multiposets to be structures consisting of several partial orders and several linear orders. We allow partial orders to extend each other in an arbitrary but fixed way, and require that every partial order is extended by at least one of the linear orders. We then show that the class of all finite multiposets conforming to a fixed template has the Ramsey property.     

Angle orders,regular n-gon orders and the crossing number

A finite poset P(X,<) on a set X={ x ₁,...,x _m} is an angle order (regular n-gon order) if the elements of P(X,<) can be mapped into a family of angular regions on the plane (a family of regular polygons with n sides and having parallel sides) such that x _ij if and only if the angular region (regular n-gon) for x _i is contained in the region (regular n-gon) for x _j. In this paper we prove that there are partial orders of dimension 6 with 64 elements which are not angle orders. The smallest partial order previously known not to be an angle order has 198 elements and has dimension 7. We also prove that partial orders of dimension 3 are representable using equilateral triangles with the same orientation. This results does not generalizes to higher dimensions. We will prove that there is a partial order of dimension 4 with 14 elements which is not a regular n-gon order regardless of the value of n. Finally, we prove that partial orders of dimension 3 are regular n-gon orders for n3.This research was supported by the Natural Sciences and Engineering Research Council of Canada, grant numbers A0977 and A2415.     

LINEAR ORDERS ON RINGS

The general ideas introduced in Radeleczki and Szigeti (2004) are adapted to investigate quasi cones and cones of rings. Using the finite extension property for cones, we answer the question concerning when a compatible partial order of a ring has a compatible linear extension (equivalently, when the positive cone of this order is contained in a full cone). It turns out that, if there is no such extension, then it is caused by a finite system of polynomial-like equations satisfied by some elements of a certain finite subset of the ring and some positive elements.     

Weak effect algebras

Weak effect algebras are based on a commutative, associative and cancellative partial addition; they are moreover endowed with a partial order which is compatible with the addition, but in general not determined by it. Every BL-algebra, i.e. the Lindenbaum algebra of a theory of Basic Logic, gives rise to a weak effect algebra; to this end, the monoidal operation is restricted to a partial cancellative operation. We examine in this paper BL-effect algebras, a subclass of the weak effect algebras which properly contains all weak effect algebras arising from BL-algebras. We describe the structure of BL-effect algebras in detail. We thus generalise the well-known structure theory of BL-algebras. Namely, we show that BL-effect algebras are subdirect products of linearly ordered ones and that linearly ordered BL-effect algebras are ordinal sums of generalised effect algebras. The latter are representable by means of linearly ordered groups. This research was partially supported by the German Science Foundation (DFG) as part of the Collaborative Research Center “Computational Intelligence” (SFB 531).     

The coextension of commutative pomonoids and its application to triangular norms

Group coextensions of monoids, which generalise Schreier-type extensions of groups, have originally been defined by P.A. Grillet and J. Leech. The present paper deals with pomonoids, that is, monoids that are endowed with a compatible partial order. Following the lines of the unordered case, we define pogroup coextensions of pomonoids. We furthermore generalise the construction to the case that pomonoids instead of pogroups are used as the extending structures.

The intended application lies in fuzzy logic, where triangular norms are those binary operations that are commonly used to interpret the conjunction. We present conditions under which the coextension of a finite totally ordered monoid leads to a triangular norm. Triangular norms of a certain type can therefore be classified on the basis of the presented results.     

Archimedeanness and the MacNeille completion of pseudoeffect algebras and po-groups

Pseudoeffect (PE-) algebras are partial algebras differing from effect algebras in that they need not satisfy the commutativity assumption. PE-algebras typically arise from intervals of po-groups; this applies in particular to all those which satisfy a certain Riesz property.In this paper, we discuss the property of archimedeanness for PE-algebras on the one hand and for po-groups on the other hand. We prove that under the assumption of suphomogeneity, archimedeanness holds for a PE-algebra with the Riesz property if and only if it holds for its representing group. The algebra is in that case commutative. This result is established by using the technique of MacNeille completion. We give the exact condition for this completion to exist, and we clearly exhibit the role played by archimedeanness and by sup-homogeneity.     

On finding the jump number of a partial orber by substitution decomposition

Consider the linear extensions of a partial order. A jump occurs in a linear extension if two consecutive elements are unrelated in the partial order. The jump number problem is to find a linear extension of the ordered set which contains the smallest possible number of jumps. We discuss a decomposition approach for this problem from an algorithmic point of view. Based on this some new classes of partial orders are identified, for which the problem is polynomially solvable.     

Compatible connectedness in graphs and topological spaces

A topology on the vertex set of a graphG iscompatible with the graph if every induced subgraph ofG is connected if and only if its vertex set is topologically connected. In the case of locally finite graphs with a finite number of components, it was shown in [11] that a compatible topology exists if and only if the graph is a comparability graph and that all such topologies are Alexandroff. The main results of Section 1 extend these results to a much wider class of graphs. In Section 2, we obtain sufficient conditions on a graph under which all the compatible topologies are Alexandroff and in the case of bipartite graphs we show that this condition is also necessary.     

Order representability in groups and vector spaces

In the present paper, first we study in a systematic way the numerical representation problem for total preorders defined either on groups or on real vector spaces. Then, we consider groups and real vector spaces equipped with a topology, and analyze the fulfillment of the so-called continuous representability property; the latter meaning that every continuous total preorder defined on the given topological space admits a continuous real-valued order-preserving function. We also explore the analogous cases as above for total preorders that are compatible with the given algebraic structure, looking for real-valued, continuous or not, order-preserving functions that, in addition, are algebraic homomorphisms.     

Related structures with involution

We give a necessary and sufficient condition for an involution lattice to be isomorphic to the direct square of its invariant part. This result is applied to show relations between related lattices of an algebra. For instance, generalizing some earlier results of G. Czédli and L. Szabó it is proved that any algebra admits a connected compatible partial order whenever its quasiorder lattice is isomorphic to the direct square of its congruence lattice. Further, a majority algebra is lattice ordered if and only if the lattice of its compatible reflexive relations is isomorphic to the direct square of its tolerance lattice. In the latter case, one can establish a bijective correspondence between factor congruence pairs of the algebra and its pairs of compatible lattice orders; several consequences of this result are given.     

Circle orders,N-gon orders and the crossing number

Let ={P ₁,...,P _m } be a family of sets. A partial order P(, <) on is naturally defined by the condition P _i <P _j iff P _i is contained in P _j . When the elements of are disks (i.e. circles together with their interiors), P(, <) is called a circle order; if the elements of are n-polygons, P(, <) is called an n-gon order. In this paper we study circle orders and n-gon orders. The crossing number of a partial order introduced in [5] is studied here. We show that for every n, there are partial orders with crossing number n. We prove next that the crossing number of circle orders is at most 2 and that the crossing number of n-gon orders is at most 2n. We then produce for every n4 partial orders of dimension n which are not circle orders. Also for every n>3, we prove that there are partial orders of dimension 2n+2 which are not n-gon orders. Finally, we prove that every partial order of dimension 2n is an n-gon order.This research was supported under Natural Sciences and Engineering Research Council of Canada (NSERC Canada) grant numbers A2507 and A0977.     

Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach

We briefly consider several formulations of Farkas' Lemma first. Then we assume the setting of two vector spaces, one of them being linearly ordered, over a linearly ordered field till the end of this article. In this setting, we state a generalized version of Farkas' Lemma and prove it in a purely linear-algebraic way. Afterwards, we present Theorems of Motzkin, Tucker, Carver, Dax, and some other theorems of the alternative that characterize consistency of a finite system of linear inequalities. We also mention the Key Theorem, which is a related result. Finally, we use Farkas' Lemma to prove the Duality Theorem for linear programming (with a finite number of linear constraints). The Duality Theorem that is proved here covers, among others, linear programming in a real vector space of finite or infinite dimension and lexicographic linear programming.     

Angle orders

A finite poset is an angle order if its points can be mapped into angular regions in the plane so thatx precedesy in the poset precisely when the region forx is properly included in the region fory. We show that all posets of dimension four or less are angle orders, all interval orders are angle orders, and that some angle orders must have an angular region less than 180° (or more than 180°). The latter result is used to prove that there are posets that are not angle orders.The smallest verified poset that is not an angle order has 198 points. We suspect that the minimum is around 30 points. Other open problems are noted, including whether there are dimension-5 posets that are not angle orders.Research supported in part by the National Science Foundation, grant number DMS-8401281.     

Tame parts of free summands in coproducts of Priestley spaces

It is well known that a sum (coproduct) of a family of Priestley spaces is a compactification of their disjoint union, and that this compactification in turn can be organized into a union of pairwise disjoint order independent closed subspaces Xu, indexed by the ultrafilters u on the index set I. The nature of those subspaces Xu indexed by the free ultrafilters u is not yet fully understood.In this article we study a certain dense subset satisfying exactly those sentences in the first-order theory of partial orders which are satisfied by almost all of the Xi's. As an application we present a complete analysis of the coproduct of an increasing family of finite chains, in a sense the first non-trivial case which is not a ?ech-Stone compactification of the disjoint union I_?Xi. In this case, all the Xu's with u free turn out to be isomorphic under the Continuum Hypothesis.     

A condition for constructing formally real monoid algebras

In this paper we demonstrate that every positive totally ordered commutative monoid on 2 generators satisfying a weak cancellation property is a convex Rees quotient of a sub-monoid of a totally ordered Abelian group. In [1], the current author, along with Evans, Konikoff, Mathis, and Madden, employed the work of Hion, [5], to demonstrate that the monoid ring of all finite formal sums over a totally ordered domain is a formally real totally ordered ring providing the totally ordered monoid satisfies this weak cancellation property and is a convex Rees quotient of a sub-monoid of a totally ordered Abelian group. Therefore, we provide here significant information about a condition for the construction of formally real totally ordered monoid algebras. Received November 4, 2003; accepted in final form November 18, 2004.     

Weak orders admitting a perpendicular linear order

Two orders on the same set are perpendicular if the constant maps and the identity map are the only maps preserving both orders. We characterize the finite weak orders admitting a perpendicular linear order.     

Crowns,cutsets, and valuable partial orders

We consider the problem of recognizing those partial orders which admit a valuation: this is a linear-algebraic condition which arises naturally in an algebraic/geometric context. We show that a partial order has at most one valuation (which is integer-valued) and present various structural conditions which are either necessary or sufficient for a partial order to be valuable. The first main result is a reduction theorem which allows us to restrict attention to those partial orders which do not have a bounded cutset. We use this and a theorem of Kelly and Rival to prove the second main result: that every contraction of a bounded partial order is fibre-valuable if and only if the partial order is a dismantlable lattice. This result has a geometric interpretation.This research was supported by the Natural Sciences and Engineering Research Council of Canada under operating grant OGP0105392.     

Lattice-theoretic properties of algebras of logic

In the theory of lattice-ordered groups, there are interesting examples of properties — such as projectability — that are defined in terms of the overall structure of the lattice-ordered group, but are entirely determined by the underlying lattice structure. In this paper, we explore the extent to which projectability is a lattice-theoretic property for more general classes of algebras of logic. For a class of integral residuated lattices that includes Heyting algebras and semi-linear residuated lattices, we prove that a member of such is projectable iff the order dual of each subinterval [a,1]$[a,1]$ is a Stone lattice. We also show that an integral GMV algebra is projectable iff it can be endowed with a positive Gödel implication. In particular, a ΨMV or an MV algebra is projectable iff it can be endowed with a Gödel implication. Moreover, those projectable involutive residuated lattices that admit a Gödel implication are investigated as a variety in the expanded signature. We establish that this variety is generated by its totally ordered members and is a discriminator variety.     

A Simple Proof of Suzumura's Extension Theorem for Finite Domains With Applications

In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extension theorem due to Szpilrajn [1930] follows from this theorem. Szpilrajns extension theorem is used to show that an asymmetric binary relation is contained in the asymmetric part of a linear order if and only if it is acyclic. This theorem is then applied to prove three results. Finally we introduce the concept of a threshold choice function, and our third result says that such choice functions are the only ones to satisfy a property called functional acyclicity.