Über Homologiegruppen von Faserbündeln

Let L be a distributive lattice with 0 and C (L) be its lattice of congruences. The skeleton, SC (L), of C (L) consists of all those congruences which are the pseudocomplements of members of C (L), and is a complete BOOLEan lattice. An ideal is the kernel of a skeletal congruence if and only if it is an intersection of relative annihilator ideals, i.e. ideals of the form <r, s>j={x∈L: xΔr≤s} for suitable r, s∈L. The set KSC (L) of all such kernels forms an upper continuous distributive lattice and the map a ? (a={x∈L: x≤a} is a lower regular joindense embedding of L into KSC (L). The relationship between SC (L) and KSC (L) leads to numerous characterizations of disjunctive and generalized BOOLEan lattices. In particular, a distributive lattice L is disjunctive (generalized Boolean) if and only if the map Θ ? ker Θ is a lattice-isomorphism of SC (L) onto KSC (L), whose inverse is the map J ? Θ (J)** (the map J ? Θ(J)). In addition, a study of KSC (L) leads to new simple proofs of results on the completions of special classes of lattices.     

The automorphism group of a function lattice: A problem of Jónsson and McKenzie

It is shown that Aut(L ^Q ) is naturally isomorphic to Aut(L) × Aut(Q) whenL is a directly and exponentially indecomposable lattice,Q a non-empty connected poset, and one of the following holds:Q is arbitrary butL is ajm-lattice,Q is finitely factorable and L is complete with a join-dense subset of completely join-irreducible elements, orL is arbitrary butQ is finite. A problem of Jónsson and McKenzie is thereby solved. Sharp conditions are found guaranteeing the injectivity of the natural mapv _P,Q from Aut(P) × Aut(Q) to Aut(P ^Q )P andQ posets), correcting misstatements made by previous authors. It is proven that, for a bounded posetP and arbitraryQ, the Dedekind-MacNeille completion ofP ^Q ,DM(P ^Q ), is isomorphic toDM(P)^Q. This isomorphism is used to prove that the natural mapv _P,Q is an isomorphism ifv _DM(P),Q is, reducing a poset problem to a more tractable lattice problem.Presented by B. Jonsson.The author would like to thank his supervisor, Dr. H. A. Priestley, for her direction and advice as well as his undergraduate supervisor, Prof. Garrett Birkhoff, and Dr. P. M. Neumann for comments regarding the paper. This material is based upon work supported under a (U.S.) National Science Foundation Graduate Research Fellowship and a Marshall Aid Commemoration Commission Scholarship.     

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.     

Jordan Derivations of Reflexive Algebras

Let ${\mathcal L}Let L{\mathcal L} be a subspace lattice on a Banach space X and suppose that ú{L ? L: L_- < X}=X{\vee\{L\in\mathcal L: L_- < X\}=X} or ${\land\{L_- : L \in \mathcal L, L>(0)\}=(0)}${\land\{L_- : L \in \mathcal L, L>(0)\}=(0)} . Then each Jordan derivation from AlgL{\mathcal L} into B(X) is a derivation. This result can apply to completely distributive subspace lattice algebras, J{\mathcal J} -subspace lattice algebras and reflexive algebras with the non-trivial largest or smallest invariant subspace.     

On lattices embeddable into lattices of algebraic subsets

We prove that, for a Scott-continuous lattice L, the lattice Sp(L) of algebraic subsets of L has a meet-complete lattice embedding into the lattice of algebraic subsets of a bi-algebraic distributive lattice.     

Indecomposable matrices over a distributive lattice

In this paper, the concepts of indecomposable matrices and fully indecomposable matrices over a distributive lattice L are introduced, and some algebraic properties of them are obtained. Also, some characterizations of the set F _n (L) of all n × n fully indecomposable matrices as a subsemigroup of the semigroup H _n (L) of all n × n Hall matrices over the lattice L are given.     

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.     

The Semigroup of Circulant Matrices Over a Lattice

Let C_n(L) denote the set of all n × n circulant matrices over a distributive lattice L. Then C_n(L) forms a semigroup under the usual matrix product. In this paper, we shall characterize all idempotents in C_n(L), and also estabish the Euler-Fermat theorem for the semigroup C_n(L).AMS Subject Classification (2000): 20MSupported by the Educational Committee of Fujian, China.     

Fuzzy prime Boolean filters and their operations in IMT L-algebras

Some characterizations of fuzzy prime Boolean filters of IMT L-algebras are given. The lattice operations and the order-reversing involution on the set PB(M) of all fuzzy prime Boolean filters of IMT L-algebras are defined. It is showed that the set PB(M) endowed with these operations is a complete quasi-Boolean algebra (a distributive complete lattice with an order-reversing involution). It is derived that the algebra M=F, which is the set of all cosets of F, is isomorphic to the Boolean algebra {0; 1} if F is a fuzzy prime Boolean filter. By introducing an adjoint pair on PB(M), it is proved that the set PB(M) is also a residuated lattice.     

Minkowski Length of 3D Lattice Polytopes

We study the Minkowski length L(P) of a lattice polytope P, which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P. The Minkowski length represents the largest possible number of factors in a factorization of polynomials with exponent vectors in P, and shows up in lower bounds for the minimum distance of toric codes. In this paper we give a polytime algorithm for computing L(P) where P is a 3D lattice polytope. We next study 3D lattice polytopes of Minkowski length 1. In particular, we show that if Q, a subpolytope of P, is the Minkowski sum of L=L(P) lattice polytopes Q _i , each of Minkowski length 1, then the total number of interior lattice points of the polytopes Q ₁,??,Q _L is at most 4. Both results extend previously known results for lattice polygons. Our methods differ substantially from those used in the two-dimensional case.     

Insertion of lattice-valued and hedgehog-valued functions

Problems of inserting lattice-valued functions are investigated. We provide an analogue of the classical insertion theorem of Lane [Proc. Amer. Math. Soc. 49 (1975) 90-94] for L-valued functions where L is a ?-separable completely distributive lattice (i.e. L admits a countable join-dense subset which is free of completely join-irreducible elements). As a corollary we get an L-version of the Katětov-Tong insertion theorem due to Liu and Luo [Topology Appl. 45 (1992) 173-188] (our proof is different and much simpler). We show that ?-separable completely distributive lattices are closed under the formation of countable products. In particular, the Hilbert cube is a ?-separable completely distributive lattice and some join-dense subset is shown to be both order and topologically isomorphic to the hedgehog J(ω) with appropriately defined topology. This done, we deduce an insertion theorem for J(ω)-valued functions which is independent of that of Blair and Swardson [Indian J. Math. 29 (1987) 229-250]. Also, we provide an iff criterion for inserting a pair of semicontinuous function which yields, among others, a characterization of hereditarily normal spaces.     

Congruence lattices of function lattices

Thefunction lattice L ^P is the lattice of all isotone maps from a posetP into a latticeL.D. Duffus, B. Jónsson, and I. Rival proved in 1978 that for afinite poset P, the congruence lattice ofL ^P is a direct power of the congruence lattice ofL; the exponent is |P|.This result fails for infiniteP. However, utilizing a generalization of theL ^P construction, theL[D] construction (the extension ofL byD, whereD is a bounded distributive lattice), the second author proved in 1979 that ConL[D] is isomorphic to (ConL) [ConD] for afinite lattice L.In this paper we prove that the isomorphism ConL[D](ConL)[ConD] holds for a latticeL and a bounded distributive latticeD iff either ConL orD is finite.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.     

On the lattice of n-filters of an LM n -algebra

For an n-valued Łukasiewicz-Moisil algebra L (or LM _n -algebra for short) we denote by F _n (L) the lattice of all n-filters of L. The goal of this paper is to study the lattice F _n (L) and to give new characterizations for the meet-irreducible and completely meet-irreducible elements on F _n (L).      

The lattice of idempotent distributive semiring varieties

A solution is given for the word problem for free idempotent distributive semirings. Using this solution the latticeL (ID) of subvarieties of the variety ID of idempotent distributive semirings is determined. It turns out thatL (ID) is isomorphic to the direct product of a four-element lattice and a lattice which is itself a subdirect product of four copies of the latticeL(B) of all band varieties. ThereforeL(ID) is countably infinite and distributive. Every subvariety of ID is finitely based. Project supported by the National Natural Science Foundation of China (Grant No. 19761004) and the Provincial Applied Fundamental Research Foundation of Yunnan (96a001z).     

Lattices of Subalgebras of Leibniz Algebras

I describe the lattice ?(L) of subalgebras of a one-generator Leibniz algebra L. Using this, I show that, apart from one special case, a lattice isomorphism φ: ?(L) → ?(L′) between Leibniz algebras L, L′ maps the Leibniz kernel Leib(L) of L to Leib(L′).     

On the distributive radical of an Archimedean lattice-ordered group

Let G be an Archimedean ℓ-group. We denote by G ^d and R _D (G) the divisible hull of G and the distributive radical of G, respectively. In the present note we prove the relation (R _D (G)) ^d = R _D (G ^d ). As an application, we show that if G is Archimedean, then it is completely distributive if and only if it can be regularly embedded into a completely distributive vector lattice.     

The Semigroup of Hall Matrices over Distributive Lattices

In this paper, the semigroup Hn(L) of Hall matrices over a complete and completely distributive lattice L is studied. A Hall matrix is a matrix which is greater (for the order associated with the lattice structure) than an invertible matrix. Some necessary and sufficient conditions for a Hall matrix to be regular in the semigroup Hn(L) are given and Green's relations of the semigroup Hn(L) are described. Also, the sandwich semigroup of Hall matrices over the lattice L is studied.     

The convexity lattice of a poset

The authors investigate the lattice Co(P) of convex subsets of a general partially ordered set P. In particular, they determine the conditions under which Co(P) and Co(Q) are isomorphic; and give necessary and sufficient conditions on a lattice L so that L is isomorphic to Co(P) for some P.     

Completely prime L-filters,irreducible L-filters and sobriety

In this paper, for a frame L, we characterize modified sobriety in stratified L-topological spaces and strong L-topological spaces internally using certain classes of stratified L-filters. While the first characterization using completely prime L-filters is trivial and applies to all stratified L-topological spaces, the other one using irreducible L-filters generalizes an approach of R.E. Ho?mann to the lattice-valued case but is restricted to either the case that the lattice is a complete Boolean algebra or to the case of completely distributive lattices and strong L-topological spaces.     

Some Conditions for Matrices over an Incline To Be Invertible and General Linear Group on an Incline

Inclines are the additively idempotent semirings in which products are less than or equal to either factor. In this paper, some necessary and sufficient conditions for a matrix over L to be invertible are given, where L is an incline with 0 and 1. Also it is proved that L is an integral incline if and only if GLn（L） = PLn （L） for any n （n 〉 2）, in which GLn（L） is the group of all n × n invertible matrices over L and PLn（L） is the group of all n × n permutation matrices over L. These results should be regarded as the generalizations and developments of the previous results on the invertible matrices over a distributive lattice.