Characterization of the soluble one-generator totally saturated formations of finite groups.
Classification systems and their lattice
We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent and...
Complements of Connected Subgroups in Algebraic Groups
Concept lattices unify the Birkhoff representation theorems
Congruence lattices of free lattices in non-distributive varieties
Congruence lattices of intransitive G-Sets and flat M-Sets
An M-Set is a unary algebra whose set of operations is a monoid of transformations of ; is a G-Set if is a group. A lattice is said to be represented by an M-Set if the congruence lattice of is isomorphic to . Given an algebraic lattice , an invariant is introduced here. provides substantial information about properties common to all representations of by intransitive G-Sets. is a sublattice of (possibly isomorphic to the trivial lattice), a -product lattice. A -product...
Congruences on strong semilattices of regular simple semigroups.
Construction of codes by lattice valued fuzzy sets.
Convex isomorphic ordered sets
V. I. Marmazejev introduced in [5] the following concept: two lattices are convex isomorphic if their lattices of all convex sublattices are isomorphic. He also gave a necessary and sufficient condition under which lattices are convex isomorphic, in particular for modular, distributive and complemented lattices. The aim of this paper is to generalize this concept to ordered sets and to characterize convex isomorphic ordered sets in the general case of modular, distributive or complemented ordered...
Convex isomorphism of -lattices
V. I. Marmazejev introduced in [3] the following concept: two lattices are convex isomorphic if their lattices of all convex sublattices are isomorphic. He also gave a necessary and sufficient condition under which the lattice are convex isomorphic, in particular for modular, distributive and complemented lattices. The aim this paper is to generalize this concept to the -lattices defined in [2] and to characterize the convex isomorphic -lattices.
Countable chains of distributive lattices as maximal semilattice quotients of positive cones of dimension groups
We construct a countable chain of Boolean semilattices, with all inclusion maps preserving the join and the bounds, whose union cannot be represented as the maximal semilattice quotient of the positive cone of any dimension group. We also construct a similar example with a countable chain of strongly distributive bounded semilattices. This solves a problem of F. Wehrung.