Finite distributive lattices are congruence lattices of almost-geometric lattices

A semimodular lattice L of finite length will be called an almost-geometric lattice if the order J(L) of its nonzero join-irreducible elements is a cardinal sum of at most two-element chains. We prove that each finite distributive lattice is isomorphic to the lattice of congruences of a finite almost-geometric lattice.     

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.     

On the lattice formed by all normal subloops of a finite loop

All normal subloops of a loopG form a modular latticeL _n (G). It is shown that a finite loopG has a complemented normal subloop lattice if and only ifG is a direct product of simple subloops. In particular,L _n (G) is a Boolean algebra if and only if no two isomorphic factors occurring in a decomposition ofG are abelian groups. The normal subloop lattice of a finite loop is a projective geometry if and only ifG is an elementary abelianp-group for some primep.     

Relative de Morgan lattices

Let L be a finite distributive lattice. It is shown that every interval of L is a de Morgan lattice if and only if L contains no interval isomorphic to 2²⊕1 or to 1⊕2². Other characterizations of such lattices are also provided.     

On the complemented subspaces problem

A Banach space is isomorphic to a Hilbert space provided every closed subspace is complemented. A conditionally σ-complete Banach lattice is isomorphic to anL _p -space (1≤p<∞) or toc ₀(Γ) if every closed sublattice is complemented.     

Singularities of Toric Varieties Associated with Finite Distributive Lattices

With each finite lattice L we associate a projectively embedded scheme V(L); as Hibi has shown, the lattice D is distributive if and only if V(D) is irreducible, in which case it is a toric variety. We first apply Birkhoff's structure theorem for finite distributive lattices to show that the orbit decomposition of V(D) gives a lattice isomorphic to the lattice of contractions of the bounded poset of join-irreducibles of D. Then we describe the singular locus of V(D) by applying some general theory of toric varieties to the fan dual to the order polytope of P: V(D) is nonsingular along an orbit closure if and only if each fibre of the corresponding contraction is a tree. Finally, we examine the local rings and associated graded rings of orbit closures in V(D). This leads to a second (self-contained) proof that the singular locus is as described, and a similar combinatorial criterion for the normal link of an orbit closure to be irreducible.     

Algebraic Topological Closure Operators

For any closure operator c there is a T_o-closure operator whose lattice of closed subsets are isomorphic to that of c. A correspondence between algebraic topological (T_o) closure operators on a nonempty set X and pre-orderes (partial orders) on X is established. Equivalent conditions are obtained for a T_o-lattice to be a complete atomic Boolean algebra and for the lattice of closed subsets of an algebraic topological closure operator to be a complete atomic Boolean algebra. Further it is proved that a complete lattice is an algebraic T_o-lattice if and only if it is isomorphic to the lattice of closed subsets of some algebraic topological closure operator on a suitable set.AMS Subject Classification (1991): 06A23, 54D65.     

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.     

Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices

Let be a {0, 1}-homomorphism of a finite distributive lattice D into the congruence lattice Con L of a rectangular (whence finite, planar, and semimodular) lattice L. We prove that L is a filter of an appropriate rectangular lattice K such that ConK is isomorphic with D and is represented by the restriction map from Con K to Con L. The particular case where is an embedding was proved by E.T. Schmidt. Our result implies that each {0, 1}-lattice homomorphism between two finite distributive lattices can be represented by the restriction of congruences of an appropriate rectangular lattice to a rectangular filter.     

Effectively and Noneffectively Nowhere Simple Sets

R. Shore proved that every recursively enumerable (r. e.) set can be split into two (disjoint) nowhere simple sets. Splitting theorems play an important role in recursion theory since they provide information about the lattice ? of all r. e. sets. Nowhere simple sets were further studied by D. Miller and J. Remmel, and we generalize some of their results. We characterize r. e. sets which can be split into two (non) effectively nowhere simple sets, and r. e. sets which can be split into two r. e. non-nowhere simple sets. We show that every r. e. set is either the disjoint union of two effectively nowhere simple sets or two noneffectively nowhere simple sets. We characterize r. e. sets whose every nontrivial splitting is into nowhere simple sets, and r. e. sets whose every nontrivial splitting is into effectively nowhere simple sets. R. Shore proved that for every effectively nowhere simple set A, the lattice L* (A) is effectively isomorphic to ?*, and that there is a nowhere simple set A such that L*(A) is not effectively isomorphic to ?*. We prove that every nonzero r. e. Turing degree contains a noneffectively nowhere simple set A with the lattice L*(A) effectively isomorphic to ?*. Mathematics Subject Classification: 03D25, 03D10.     

Convex partitions of a finite lattice

The purpose of this paper is to introduce the lattice of convex partitions for a lattice L. Then we will show some properties of this lattice. Finally, we will show that if the convex partition lattice of L is finite and modular if and only if L is a finite chain. Presented by R. McKenzie. Received December 16, 2004; accepted in final form March 7, 2006.     

Meet-distributive lattices and the anti-exchange closure

This paper defines the anti-exchange closure, a generalization of the order ideals of a partially ordered set. Various theorems are proved about this closure. The main theorem presented is that a latticeL is the lattice of closed sets of an anti-exchange closure if and only if it is a meet-distributive lattice. This result is used to give a combinatorial interpretation of the zetapolynomial of a meet-distributive lattice. Work done while the author was an Applied Mathematics Fellow at M.I.T. Presented by R. P. Dilworth     

Excluded–Minor Characterizations of Antimatroids arisen from Posets and Graph Searches

An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is a ’dual’ or ‘antipodal’ concept of matroid.We shall show that an antimatroid is derived from shelling of a poset if and only if it does not contain a minor isomorphic to S₇ where S₇ is the smallest semimodular lattice that is not modular (See Fig. 1). It is also shown that an antimatroid is a node-search antimatroid of a digraph if and only if it does not contain a minor isomorphic to D₅ where D₅ is a lattice consisting of five elements Ø {x},{y}, {x, y} and {x, y, z}. Furthermore, an antimatroid is shown to be a node-search antimatroid of an undirected graph if and only if it does not contain D₅ nor S₁₀ as a minor: S₁₀ is a locally free lattice consisting of ten elements shown in Fig. 2.     

The lattice of closure relations on a poset

In this paper we show that the set of closure relations on a finite posetP forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense of Edelman and Jamison [EJ]). We also characterize the modular elements of this lattice (whenP has a greatest element) and compute its characteristic polynomial.Presented by R. W. Quackenbush.     

Ideals associated with realcompactness in pointfree function rings

Abstract

Let RL denote the ring of continuous real-valued functions on a com- pletely regular frame L. The support of an α ∈ RL is the closed quotient ↑(coz α)?. We show that if supports are coz-quotients in L, then the set of functions with realcompact support is an ideal. If L satisfies the stronger condition that supports are C-quotients, then this ideal is the intersection of pure parts of the free maximal ideals of RL. The set of functions whose cozeroes are realcompact is always an ideal, which is free if and only if L is locally realcompact if and only if L is (isomorphic to) an open quotient of υL. Further, this ideal is prime if and only if it is a free real maximal ideal if and only if υL → L is a one-point extension of L.     

A note on non-support points, negligible sets, Gâteaux differentiability and Lipschitz embeddings

This paper first presents a characterization of three classes of negligible closed convex sets (i.e., Gauss null sets, Aronszajn null sets and cube null sets) in terms of non-support points; then gives a generalization of Gâteaux differentiability theorems of Lipschitz mapping from open sets to those closed convex sets admitting non-support points; and as their application, finally shows that a closed convex set in a separable Banach space X can be Lipschitz embedded into a Banach space Y with the Radon–Nikodym property if and only if the closure of its linear span is linearly isomorphic to a closed subspace of Y.     

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.     

Strictly Order-Preserving Maps into Z, II. A 1979 Problem of Erné

A lattice L is constructed with the property that every interval has finite height, but there exists no strictly order-preserving map from L to Z. A 1979 problem of Erné (posed at the 1981 Banff Conference on Ordered Sets) is thus solved. It is also shown that if a poset P has no uncountable antichains, then it admits a strictly order-preserving map into Z if and only if every interval has finite height.