The order dimension of relatively free lattices

If V is a nontrivial lattice variety and is an infinite cardinal, then the order dimension of FV() is the smallest cardinal such that 2.This research was supported in part by NSF Grants DMS 87-03540 (Nation) and DMS 86-01576 (Schmerl).     

Varieties generated by lattices of breadth two

Some relations between the classB of lattices of breadth at most two and its subclassD of dismantlable lattices, as well as the lattice varietiesV (B) andV (D) generated byV (D) andV (D), respectively, are studied in this paper. For finite join-semidistributive lattices, the two concepts of dismantlability and breadth at most two coincide. There are infinitely many lattice varieties between the varietiesV (D) andV (B), none of them is finitely based.     

On the category Q-Mod

In this paper we consider the category Q-Mod of modules over a given quantale Q. The paper is motivated by constructions and results from the category of modules over a ring. We show that the category Q-Mod is monadic, consider its relation to the category Q-Top of Q-topological spaces and generalize a method of completion of partially ordered sets. Received December 20, 2005; accepted in final form December 4, 2006.     

Singular covers in free lattices

A covering a>b in a lattice is called a singular cover if a is join irreducible and b is meet irreducible. A classification of the singular covers which occur in free lattices is given.     

Lattices isomorphic with their free powers

For any N3 there exists a lattice L isomorphic with NL (the free product of its own N copies) but not isomorphic with kL for any k–2,...,N-1.     

Complementing lattice-ordered groups: The projectable case

A complemented l-group G is one in which to each a G there corresponds a b G so that |a||b|=0, while |a||b| is a unit of G. For projectable l-groups this is so precisely when the group possesses a unit.The article introduces the notion of complementation, and the situation for projectable l-groups is analyzed in some detail; in particular, it is shown that any projectable l-group having a projectable complementation in which it is convex has a unique maximal one of this kind.A portion of this research was carried out while this author was a Stauffer Visiting Professor at the University of Kansas during the year 1986–87. He thanks his colleagues in mathematics at that institution for their hospitality.     

Infinite intervals in free lattices

if u/v is any infinite interval in FL(X), the free lattice with generating set X, and then u/v contains a sublattice isomorphic to FL(Y). This result answers a question posed by Ralph Freese and J. B. Nation in their paper Covers in Free Lattices [2] and the principal techniques used in proving this result all come from that paper. The most difficult step in the argument is to show that there are incomparable elements in any infinite interval.     

Free lattice algorithms

In the late 1930s Phillip Whitman gave an algorithm for deciding for lattice terms v and u if vu in the free lattice on the variables in v and u. He also showed that each element of the free lattice has a shortest term representing it and this term is unique up to commutivity and associativity. He gave an algorithm for finding this term. Almost all the work on free lattices uses these algorithms. Building on the work of Ralph McKenzie, J. B. Nation and the author have developed very efficient algorithms for deciding if a lattice term v has a lower cover (i.e., if there is a w with w covered by v, which is denoted by w) and for finding them if it does. This paper studies the efficiency of both Whitman's algorithm and the algorithms of Freese and Nation. It is shown that although it is often quite fast, the straightforward implementation of Whitman's algorithm for testing vu is exponential in time in the worst case. A modification of Whitman's algorithm is given which is polynomial and has constant minimum time. The algorithms of Freese and Nation are then shown to be polynomial.     

Abelian groups determined by subgroup lattices of direct powers

In this short note, we showthat the class of abelian groups determined by the subgroup lattice of their direct n-powers is exactly the class of the abelian groups which share the n-root property. As applications we answer in the negative a (semi)conjecture of Pálfy and solve a more general problem. Received: 24 February 2005     

Homogeneity in finite ordered sets

A tower in an ordered set (X, ) is defined to be a subsetS ofX which has the property that for everysS there is a maximal chainC in {xX|xs} which is wholly contained inS. An ordered set (X, ) is called tower-homogeneous if every order isomorphism between towers in (X, ) can be extended to an automorphism of (X, ). It is shown that a finite ordered set is tower-homogeneous if and only if it can be built up from singletons stepwise by constructions of three different types.     

Infinite independent sets in distributive lattices

We show that a poset P contains a subset isomorphic to if and only if the poset J(P) consisting of ideals of P contains a subset isomorphic to the power set of κ. If P is a join-semilattice this amounts to the fact that P contains an independent set of size κ. We show that if κ := ω and P is a distributive lattice, then this amounts to the fact that P contains either or as sublattices, where Γ and Δ are two special meet-semilattices already considered by J. D. Lawson, M. Mislove and H. A. Priestley.Dedicated to the memory of Ivan RivalReceived April 22, 2003; accepted in final form July 11, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Many varieties of lattices with nonsurjective epimorphisms

We use dominions to show that many varieties of lattices have nonsurjective epimorphisms. The variety D of distributive lattices is treated in detail. We show that the dominion in D of a sublattice is the closure of M under relative complementation in L. This dominion is also the largest sublattice of L in which M is epimorphically embedded. In any variety of lattices larger than D, the dominion of M in L is just M. Received May 1, 2001; accepted in final form October 4, 2005.     

Orthomodular lattices in ordered vector spaces

In a partly ordered space the orthogonality relation is defined by incomparability. We define integrally open and integrally semi-open ordered real vector spaces. We prove: if an ordered real vector space is integrally semi-open, then a complete lattice of double orthoclosed sets is orthomodular. An integrally open concept is closely related to an open set in the Euclidean topology in a finite dimensional ordered vector space. We prove: if V is an ordered Euclidean space, then V is integrally open and directed (and is also Archimedean) if and only if its positive cone, without vertex 0, is an open set in the Euclidean topology (and also the family of all order segments , a < b, is a base for the Euclidean topology). Received January 7, 2005; accepted in final form November 26, 2005.     

Automorphisms and isotone self-maps of ordered sets with top and bottom

For an ordered setP letP ^P denote the set of all isotone self-maps on P, that is, all mapsf fromP toP such thatxy impliesf(x)f(y), and let Aut (P) the set of all automorphisms onP, that is, all bijective isotone self-maps inP ^P . We establish an inequality relating ¦P ^P ¦ and ¦Aut(P)¦ in terms of the irreducibles ofP. As a straightforward corollary, we show that Rival and Rutkowski's automorphism conjecture is true for lattices. It is also true for ordered sets with top and bottom whose covering graphs are planar.Supported in part by NSERC (Grant no. A2507).Supported under an NSERC International Research Fellowship.     

Sublattices of complete lattices with continuity conditions

Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice Id S of S is both algebraic and dually algebraic. Furthermore, if there are no infinite D-sequences in J(S), then Id S can be embedded into a direct product of finite lower bounded lattices. We also find a system of infinitary identities that characterize sublattices of complete, lower continuous, and join-semidistributive lattices. These conditions are satisfied by any (not necessarily finitely generated) lower bounded lattice and by any locally finite, join-semidistributive lattice. Furthermore, they imply M. Erné’s dual staircase distributivity.On the other hand, we prove that the subspace lattice of any infinite-dimensional vector space cannot be embedded into any ℵ₀-complete, ℵ₀-upper continuous, and ℵ₀-lower continuous lattice. A similar result holds for the lattice of all order-convex subsets of any infinite chain.Dedicated to the memory of Ivan RivalReceived April 4, 2003; accepted in final form June 16, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Monotone clones and congruence modularity

We investigate the relationship between the local shape of an ordered set P=(P; ) and the congruence-modularity of the variety V generated by an algebra A=(P; F) each of whose operations is order-preserving with respect to P. For example, if V is k-permutable (k2) then P is an antichain; if P is both up and down directed and V is congruence-modular, then V is congruence-distributive; if A is a dual discriminator algebra, then either P is an antichain or a two-element chain. We also give a useful necessary condition on P for V to be congruence-modular. Finally a class of ordered sets called braids is introduced and it is shown that if P is a braid of length 1, in particular if P is a crown, then the variety V is not congruence-modular.     

The free \mathfrak{m} -lattice on the poset H

Let H={a ₀, a ₁, a ₂, b ₀, b ₁, b ₂} be the poset defined by a ₀<a ₂<a ₁, b ₀<b ₂<b ₁, a ₀<b ₁, and b ₀<a ₁. For an infinite regular cardinal , we describe the free -lattice on H. This continues the work of I. Rival and R. Wille who accomplished the same for =. In subsequent papers, we show how to apply this result to describe the free -lattice on a poset for a large class of posets, called slender posets.     

On the best bound of the minimal twisted height of linear subspaces

Let V be a vector space over a global field k, g an element of the adele group and H_g the twisted height defined on the k-subspaces of V . We show that the square root of the generalized Hermite-Rankin constant for k gives the best upper bound of the function , where runs over all m-dimensional k-subspaces of V and runs over all n-dimensional k-subspaces of . Received: 17 June 2005     

When an algebraic frame is regular

It is shown that an algebraic frame L is regular if and only if its compact elements are complemented. More generally, it is shown that each pseudocomplemented element is regular if and only if each , with c compact, is complemented. With a mild assumption on L, each , with c compact, is regular precisely when for any two minimal primes p and q of L. These results are then interpreted in various frames of subobjects of lattice-ordered groups and f-rings.     

Path-closed sets

Given a digraphG = (V, E), call a node setT ⊆V path-closed ifv, v′ εT andw εV is on a path fromv tov′ impliesw εT. IfG is the comparability graph of a posetP, the path-closed sets ofG are the convex sets ofP. We characterize the convex hull of (the incidence vectors of) all path-closed sets ofG and its antiblocking polyhedron inR ^v , using lattice polyhedra, and give a minmax theorem on partitioning a given subset ofV into path-closed sets. We then derive good algorithms for the linear programs associated to the convex hull, solving the problem of finding a path-closed set of maximum weight sum, and prove another min-max result closely resembling Dilworth’s theorem.