Local separation in distributive semilattices

We introduce the Local Separation Property (LSP) for distributive semilattices. We show that LSP holds in many semilattices of the form Con_c A, where A is a lattice. On the other hand, we construct an abstract example of a distributive lattice without LSP. Our research is connected with the well known open problem whether every distributive algebraic lattice is isomorphic to the congruence lattice of some lattice. Received December 10, 2004; accepted in final form June 6, 2005.     

Relative separation in distributive congruence lattices

In [5] we defined separable sets in algebraic lattices and showed a close connection between the types of non-separable sets in congruence lattices of algebras in a finitely generated congruence distributive variety and the structure of subdirectly irreducible algebras in Now we generalize these results using the concept of relatively separable sets (with respect to subsets) and apply them to some lattice varieties.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived November 29, 2002; accepted in final form August 19, 2004.     

Almost distributive sublattices and congruence heredity

A congruence lattice L of an algebra A is hereditary if every 0-1 sublattice of L is the congruence lattice of an algebra on A. Suppose that L is a finite lattice obtained from a distributive lattice by doubling a convex subset. We prove that every congruence lattice of a finite algebra isomorphic to L is hereditary. Presented by E. W. Kiss. Received July 18, 2005; accepted in final form April 2, 2006.     

Finite axiomatizations for existentially closed posets and semilattices

In this paper we exhibit axiomatizations for the theories of existentially closed posets and existentially closed semilattices. We do this by considering an infinite axiomatization which characterizes these structures in terms of embeddings of finite substructures, an axiomatization which exists for any locally finite universal class with a finite language and with the joint embedding and amalgamation properties. We then find particular finite subsets of these axioms which suffice to axiomatize both classes. Research supported by an NSERC Postdoctoral Fellowship. Research supported by NSERC Grant No. A7256.     

Projective extensions of semilattices

Sabine Koppelberg has introduced and studied the notion of projective extensions of Boolean algebras. Our aim is to characterize the projective extensions of semilattices. Received December 16, 2004; accepted in final form September 8, 2005.     

A notion of branching rank for semilattices with descending chain condition

Given a maximal subchainC of a semilatticeS, there are some natural leaves ofS attached to it. These are subsemilattices ofS which may have a simpler structure thanS itself. We look atS as build up fromC together with its leaves. Starting with one-point subsemilattices, the (branching) rank ofS is defined to be the least number of steps needed to recoverS. For technical reasons, only semilattices with no infinite descending chains are considered. The main result states that ifR is a subsemilattice ofS and rankS is defined, then rankRrankS. On the other hand, rank does not behave well with respect to epimorphisms. Several examples are presented as well as various results concerning finite semilattices and trees.This work was supported, in part, by NSERC Grant A4044.     

Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices

A poset P is -conditionally complete ( a cardinal) if every set X P all of whose subsets of cardinality < have an upper bound has a least upper bound. For we characterize the subposets of a -complete poset which can occur as the set of fixed points of some montonic function on P. This yields a generalization of Tarski's fixed point theorem. We also show that for every the class of -conditionally complete posets forms an order variety and we exhibit a simple generating poset for each such class.Research supported in part by NSERC while the author was visiting Professor Ivo Rosenberg at the Université de Montreal.Research supported in part by NSF-grant DMS-8703743.     

A maximal clone of monotone operations which is not finitely generated

There is only one maximal clone on a set of at most eight elements which has not been known to be finitely generated. We show that it is not finitely generated.     

On isotone functions with the Substitution Property in distributive lattices

A universal algebra isaffine complete if all functions satisfying the Substitution Property are polynomials (composed of the basic operations and the elements of the algebra). In 1962, the first author proved that a bounded distributive lattice is affine complete if and only if it does not contain a proper Boolean interval. Recently, M. Ploica generalized this result to arbitrary distributive lattices.In this paper, we introduce a class of functions on a latticeL, we call themID-polynomials, that derive from polynomials on the ideal lattice (resp., dual ideal lattice) ofL; they are isotone functions and satisfy the Substitution Property. We prove that for a distributive latticeL, all unary functions with the Substitution Property are ID-polynomials if and only ifL contains no proper Boolean interval.The research of the first author was supported by the NSERC of Canada. The research of the second author was supported by the Hungarian National Foundation for Scientific Research, under Grant No. 1903.     

Infinite antichains in semilattices

In this paper we consider infinite antichains and the semilattices that they generate, mainly in the context of continuous semilattices. Conditions are first considered that lead to the antichain generating a copy of a countable product of the two-element semilattice. Then a special semilattice, called , is defined, its basic properties developed, and it is shown in our main result that a continuous semilattice with an infinite antichain converging to a larger element contains a semilattice copy of . The paper closes with a consideration of countable antichains that converge to a lower element or a parallel element and the kinds of semilattices generated in this context.The first two authors gratefully acknowledge the partial support of the National Science Foundation and the hospitality of Oxford University during the preparation of this paper.     

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.     

Approximate distributive laws and finite equational bases for finite algebras in congruence-distributive varieties

For a congruence-distributive variety, Maltsev’s construction of principal congruence relations is shown to lead to approximate distributive laws in the lattice of equivalence relations on each member. As an application, in the case of a variety generated by a finite algebra, these approximate laws yield two known results: the boundedness of the complexity of unary polynomials needed in Maltsev’s construction and the finite equational basis theorem for such a variety of finite type. An algorithmic version of the construction is included. Received November 27, 1996; accepted in final form December 16, 2004.     

Priestley duality for order-preserving maps into distributive lattices

The category of bounded distributive lattices with order-preserving maps is shown to be dually equivalent to the category of Priestley spaces with Priestley multirelations. The Priestley dual space of the ideal lattice L of a bounded distributive lattice L is described in terms of the dual space of L. A variant of the Nachbin-Stone-ech compactification is developed for bitopological and ordered spaces. Let X be a poset and Y an ordered space; X ^Y denotes the poset of continuous order-preserving maps from Y to X with the discrete topology. The Priestley dual of L ^P is determined, where P is a poset and L a bounded distributive lattice.     

A solution to Dilworth's congruence lattice problem

We construct an algebraic distributive lattice D that is not isomorphic to the congruence lattice of any lattice. This solves a long-standing open problem, traditionally attributed to R.P. Dilworth, from the forties. The lattice D has a compact top element and ℵω+1 compact elements. Our results extend to any algebra possessing a congruence-compatible structure of a join-semilattice with a largest element.     

On geometric semilattices

We define geometric semilattices, a generalization of geometric lattices. The poset of independent sets of a matroid is another example. We prove several axiomatic and constructive characterizations, for example: geometric semilattices are those semilattices obtained by removing a principal filter from a geometric lattice. We also show that all geometric semilattices are shellable, unifying and extending several previous results.Partially supported by NSF grant MCS 81-03474.     

Small congruence distributive varieties: Retracts, injectives, equational compactness and amalgamation

The relationship between absolute retracts, injectives and equationally compact algebras in finitely generated congruence distributive varieties with 1- element subalgebras is considered and several characterization theorems are proven. Amongst others, we prove that the absolute retracts in such a variety are precisely the injectives in the amalgamation class and that every equationally compact reduced power of a finite absolute retract is an absolute retract. We also show that any elementary amalgamation class is Horn if and only if it is closed under finite direct products. The second author's work was supported by grants from the South African Council for Scientific and Industrial Research and the University of Cape Town Research Committee.     

Subalgebras of closure algebras

Closure algebras have been intensively studied in literature ([2], [3], [11], ...) but, up to now, little interest has been devoted to subalgebras of closure algebras. In this paper, the methods of [16] are adapted to characterize closure algebras with a distributive, or a Boolean, subalgebra lattice.     

Self complementary topologies and preorders

A topology on a set X is self complementary if there is a homeomorphic copy on the same set that is a complement in the lattice of topologies on X. The problem of characterizing finite self complementary topologies leads us to redefine the problem in terms of preorders (i.e. reflexive, transitive relations). A preorder P on a set X is self complementary if there is an isomorphic copy P of P on X that is arc disjoint to P (except for loops) and with the property that PP is strongly connected. We characterize here self complementary finite partial orders and self complementary finite equivalence relations.     

Series parallel posets with nonfinitely generated clones

In 1986 Tardos proved that for the poset 1+2+2+2+1, the clone of monotone operations is nonfinitely generated. We generalize his result in the class of series parallel posets. We characterize the posets with nonfinitely generated clones in this class by the property that they have a retract of the form either 1+2+2+2+1, 2+2+1, or 1+2+2.Research partially supported by Hungarian National Foundation for Research under grant no. 1903.     

Complemented congruences on Ockham algebras

An Ockham algebra that satisfies the identity is called a K_{n, m}-algebra. Generalizing some results obtained in [2], J. Varlet and T. Blyth, in [3, Chapter 8], study congruences on K_{1, 1}-algebras. In particular, they describe the complement (when it exists) of a principal congruence and characterize these congruences that are complemented. In this paper we study the same question for K_{n, m}-algebras. Received March 24, 2005; accepted in final form April 28, 2005.