Intervals in lattices of quasiorders

We investigate the structure of intervals in the lattice of all closed quasiorders on a compact or discrete space. As a first step, we show that if the intervalI has no infinite chains then the underlying space may be assumed to be finite, and in particular,I must be finite, too. We compute several upper bounds for its size in terms of its heighth, which in turn can be computed easily by means of the least and the greatest element ofI. The cover degreec of the interval (i.e. the maximal number of atoms in a subinterval) is less than 4h. Moreover, ifc4(n–1) thenI contains a Boolean subinterval of size 2 ⁿ , and ifI is geometric then it is already a finite Boolean lattice. While every finite distributive lattice is isomorphic to some interval of quasiorders, we show that a nondistributive finite interval of quasiorders is neither a vertical sum nor a horizontal sum of two lattices, with exception of the pentagon. Many further lattices are excluded from the class of intervals of quasiorders by the fact that no join-irreducible element of such an interval can have two incomparable join-irreducible complements. Up to isomorphism, we determine all quasiorder intervals with less than 9 elements and all quasiorder intervals with two complementary atoms or coatoms.     

Isotone Maps as Maps of Congruences. II. Concrete Maps

Let L be a lattice and let L ₁, L ₂ be sublattices of L. Let be a congruence relation of L ₁. We extend to L by taking the smallest congruence......     

The Lattice of Compatible Quasiorders of Acyclic Monounary Algebras

Acyclic monounary algebras are characterized by the property that any compatible partial order r can be extended to a compatible linear order. In the case of rooted monounary algebras A=(A,f){\cal A}=(A,f) we characterize the intersection of compatible linear extensions of r by several equivalent conditions and generalize these results to compatible quasiorders of A{\cal A}. We show that the lattice QuordA{\rm{Quord}}{\cal A} of compatible quasiorders is a disjoint union of semi-intervals whose maximal elements equal the intersection of their compatible quasilinear extensions. We also investigate algebraic properties of the lattices QuordA{\rm{Quord}}{\cal A} and ConA{\rm{Con}}{\cal A}.     

Finite Intervals in the Lattice of Topologies

We discuss the question whether every finite interval in the lattice of all topologies on some set is isomorphic to an interval in the lattice of all topologies on a finite set – or, equivalently, whether the finite intervals in lattices of topologies are, up to isomorphism, exactly the duals of finite intervals in lattices of quasiorders. The answer to this question is in the affirmative at least for finite atomistic lattices. Applying recent results about intervals in lattices of quasiorders, we see that, for example, the five-element modular but non-distributive lattice cannot be an interval in the lattice of topologies. We show that a finite lattice whose greatest element is the join of two atoms is an interval of T ₀-topologies iff it is the four-element Boolean lattice or the five-element non-modular lattice. But only the first of these two selfdual lattices is an interval of orders because order intervals are known to be dually locally distributive.     

On the Theory of <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">q</Emphasis></Subscript>)-Banach Lattices

Given 1≤ p,q < ∞, let BL_pL_q be the class of all Banach lattices X such that X is isometrically lattice isomorphic to a band in some L_p(L_q)-Banach lattice. We show that the range of a positive contractive projection on any BL_pL_q-Banach lattice is itself in BL_pL_q. It is a consequence of this theorem and previous results that BL_pL_q is first-order axiomatizable in the language of Banach lattices. By studying the pavings of arbitrary BL_pL_q-Banach lattices by finite dimensional sublattices that are themselves in this class, we give an explicit set of axioms for BL_pL_q. We also consider the class of all sublattices of L_p(L_q)-Banach lattices; for this class (when p/q is not an integer) we give a set of axioms that are similar to Krivine’s well-known axioms for the subspaces of L_p-Banach spaces (when p/2 is not an integer). We also extend this result to the limiting case q = ∞.     

On the Lattice of Varieties of Involution Semigroups

In this paper, we investigate the lattice \smallbf L( \cal S ^\ast) of varieties of involution semigroups (semigroups endowed with an involutorial antiautomorphism ^\ast as a fundamental operation). There are two kinds of atoms in \smallbf L( \cal S ^\ast) : four nongroup ones and two countably infinite families of varieties of groups with involution. We exhibit the sublattices of \smallbf L( \cal S ^\ast) generated by both of these two collections of its atoms. September 9, 1999     

A note on essentially convex orders

In this note, we determine precisely which partially ordered sets (posets) have the property that, whenever they occur as subposets of a larger poset, they occur there convexly, i.e., as convex subposets. As a corollary, we also determine which lattices have the property that, if they occur as sublattices of a finite distributive lattice L, then they also occur as closed intervals in L. Throughout, all sets will be finite.Dedicated to the memory of Ivan RivalReceived May 5, 2003; accepted in final form October 3, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Graphical algebras — a new approach to congruence lattices

In 1970, H. Werner considered the question of which sublattices of partition lattices are congruence lattices for an algebra on the underlying set of the partition lattices. He showed that a complete sublattice of a partition lattice is a congruence lattice if and only if it is closed under a new operation called graphical composition. We study the properties of this new operation, viewed as an operation on an abstract lattice. We obtain some necessary properties, and we also obtain some sufficient conditions for an operation on an abstract lattice L to be this operation on a congruence lattice isomorphic to L. We use this result to give a new proof of Grätzer and Schmidt’s result that any algebraic lattice occurs as a congruence lattice.     

Identities of cofinal sublattices

If V is a variety of lattices and L a free lattice in V on uncountably many generators, then any cofinal sublattice of L generates all of V. On the other hand, any modular lattice without chains of order-type +1 has a cofinal distributive sublattice. More generally, if a modular lattice L has a distributive sublattice which is cofinal modulo intervals with ACC, this may be enlarged to a cofinal distributive sublattice. Examples are given showing that these existence results are sharp in several ways. Some similar results and questions on existence of cofinal sublattices with DCC are noted.This work was done while the first author was partly supported by NSF contract MCS 82-02632, and the second author by an NSF Graduate Fellowship.     

Sublattices of product spaces: Hulls, representations and counting

The Cartesian product of lattices is a lattice, called a product space, with componentwise meet and join operations. A sublattice of a lattice L is a subset closed for the join and meet operations of L. The sublattice hullLQ of a subset Q of a lattice is the smallest sublattice containing Q. We consider two types of representations of sublattices and sublattice hulls in product spaces: representation by projections and representation with proper boundary epigraphs. We give sufficient conditions, on the dimension of the product space and/or on the sublattice hull of a subset Q, for LQ to be entirely defined by the sublattice hulls of the two-dimensional projections of Q. This extends results of Topkis (1978) and of Veinott [Representation of general and polyhedral subsemilattices and sublattices of product spaces, Linear Algebra Appl. 114/115 (1989) 681-704]. We give similar sufficient conditions for the sublattice hull LQ to be representable using the epigraphs of certain isotone (i.e., nondecreasing) functions defined on the one-dimensional projections of Q. This also extends results of Topkis and Veinott. Using this representation we show that LQ is convex when Q is a convex subset in a vector lattice (Riesz space), and is a polyhedron when Q is a polyhedron in Rⁿ.We consider in greater detail the case of a finite product of finite chains (i.e., totally ordered sets). We use the representation with proper boundary epigraphs and provide upper and lower bounds on the number of sublattices, giving a partial answer to a problem posed by Birkhoff in 1937. These bounds are close to each other in a logarithmic sense. We define a corner representation of isotone functions and use it in conjunction with the representation with proper boundary epigraphs to define an encoding of sublattices. We show that this encoding is optimal (up to a constant factor) in terms of memory space. We also consider the sublattice hull membership problem of deciding whether a given point is in the sublattice hull LQ of a given subset Q. We present a good characterization and a polynomial time algorithm for this sublattice hull membership problem. We construct in polynomial time a data structure for the representation with proper boundary epigraphs, such that sublattice hull membership queries may be answered in time logarithmic in the size |Q| of the given subset.     

Lattices of quasiorders on universal algebras

It is proved that every algebraic lattice is isomorphic to the lattice of quasiorders on a universal algebra. Translated fromAlgebra i Logika, Vol. 34, No. 3, pp. 327-328, May-June, 1995. Supported by the Russian Foundation for Fundamental Research, grant No. 93-011-01520.     

Locally dense finite lattice packings of spheres

We consider finite packings of unit-balls in Euclidean 3-spaceE ³ where the centres of the balls are the lattice points of a lattice polyhedronP of a given latticeL ³E³. In particular we show that the facets ofP induced by densest sublattices ofL ³ are not too close to the next parallel layers of centres of balls. We further show that the Dirichlet-Voronoi-cells are comparatively small in this direction. The paper was stimulated by the fact that real crystals in general grow slowly in the directions normal to these dense facets.The results support, to some extent, the hypothesis that real crystals grow preferably such that they need little volume, i.e that they are locally dense.Dedicated to A. Florian on the occasion of this 60th birthday     

The lattice of closure operators on a subgroup lattice

We say a lattice L is a subgroup lattice if there exists a group G such that Sub(G)?L, where Sub(G) is the lattice of subgroups of G, ordered by inclusion. We prove that the lattice of closure operators which act on the subgroup lattice of a finite group G is itself a subgroup lattice if and only if G is cyclic of prime power order.     

Coincidence rotations of the root lattice

The coincidence site lattices of the root lattice A₄ are considered, and the statistics of the corresponding coincidence rotations according to their indices is expressed in terms of a Dirichlet series generating function. This is possible via an embedding of A₄ into the icosian ring with its rich arithmetic structure, which recently [M Baake, M. Heuer, R.V. Moody, Similar sublattices of the root lattice A₄, preprint arXiv:math.MG/0702448] led to the classification of the similar sublattices of A₄.     

Sublattices of the Lattices of Strong P-Congruences on P-Inversive Semigroups

In this paper, we describe strong P-congruences and sublattice-structure of the strong P-congruence lattice C_P(S) of a P-inversive semigroup S(P). It is proved that the set of all strong P-congruences C_P(S) on S(P) is a complete lattice. A close link is discovered between the class of P-inversive semigroups and the well-known class of regular ⋆-semigroups. Further, we introduce concepts of strong normal partition/equivalence, C-trace/kernel and discuss some sublattices of C_P(S). It is proved that the set of strong P-congruences, which have C-traces (C-kernels) equal to a given strong normal equivalence of P (C-kernel), is a complete sublattice of C_P(S). It is also proved that the sublattices determined by C-trace-equaling relation θ and C-kernel-equaling relation κ, respectively, are complete sublattices of C_P(S) and the greatest elements of these sublattices are given.     

Homomorphisms between the chevalley groups over any fields of characteristic zero

Given an irreducible root system ∑, let G(F,L) denote the Cheval- ley group over a field F corresponding to a lattice L between the root lattice and the weight lattice of ∑,. We will determine all nontnvial homomorphisms from G(k,L ₁) to G(K,L ₂when k and K are any fields of characteristic zero, and we will verify that any nontrivial homomorphism from G(k,L ₁) to G(K,L ₂are induced by a field homomorphism from k to K by multiplying an automorphism of G(K,L ₂.     

On the number of join-irreducibles in a congruence representation of a finite distributive lattice

For a finite lattice L, let $ \trianglelefteq_L $ denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form $ \trianglelefteq_L $, as follows: Theorem. Let $ \trianglelefteq $ be a quasi-ordering on a finite set P. Then the following conditions are equivalent:(i) There exists a finite lattice L such that $ \langle J(L), \trianglelefteq_L $ is isomorphic to the quasi-ordered set $ \langle P, \trianglelefteq \rangle $.(ii) $ |\{x\in P|p \trianglelefteq x\}| \neq 2 $, for any $ p \in P $.For a finite lattice L, let $ \mathrm{je}(L) = |J(L)|-|J(\mathrm{Con} L)| $ where Con L is the congruence lattice of L. It is well-known that the inequality $ \mathrm{je}(L) \geq 0 $ holds. For a finite distributive lattice D, let us define the join- excess function:$ \mathrm{JE}(D) =\mathrm{min(je} (L) | \mathrm{Con} L \cong D). $We provide a formula for computing the join-excess function of a finite distributive lattice D. This formula implies that $ \mathrm{JE}(D) \leq (2/3)| \mathrm{J}(D)|$ , for any finite distributive lattice D; the constant 2/3 is best possible.A special case of this formula gives a characterization of congruence lattices of finite lower bounded lattices.Dedicated to the memory of Gian-Carlo Rota     

Whaley's Theorem for Finite Lattices

Whaley's Theorem on the existence of large proper sublattices of infinite lattices is extended to ordered sets and finite lattices. As a corollary it is shown that every finite lattice L with |L|≥3 contains a proper sublattice S with |S|≥|L|^1/3. It is also shown that that every finite modular lattice L with |L|≥3 contains a proper sublattice S with |S|≥|L|^1/2, and every finite distributive lattice L with |L|≥4 contains a proper sublattice S with |S|≥3/4|L|. This revised version was published online in June 2006 with corrections to the Cover Date.     

Subalgebras of Orthomodular Lattices

Sachs (Can J Math 14:451–460, 1962) showed that a Boolean algebra is determined by its lattice of subalgebras. We establish the corresponding result for orthomodular lattices. We show that an orthomodular lattice L is determined by its lattice of subalgebras Sub(L), as well as by its poset of Boolean subalgebras BSub(L). The domain BSub(L) has recently found use in an approach to the foundations of quantum mechanics initiated by Butterfield and Isham (Int J Theor Phys 37(11):2669–2733, 1998, Int J Theor Phys 38(3):827–859, 1999), at least in the case where L is the orthomodular lattice of projections of a Hilbert space, or von Neumann algebra. The results here may add some additional perspective to this line of work.     

Regular congruence-preserving extensions of lattices

In this paper, we prove that every lattice L has a congruence-preserving extension into a regular lattice , moreover, every compact congruence of is principal. We construct by iterating a construction of the first author and F. Wehrung and taking direct limits.? We also discuss the case of a finite lattice L, in which case can be chosen to be finite, and of a lattice L with zero, in which case can be chosen to have zero and the extension can be chosen to preserve zero. Received September 10, 1999; accepted in final form October 16, 2000.