AbstractFor a finite lattice L, denote by l∗(L) and l∗(L) respectively the upper length and lower length of L. The grading number g(L) of L is defined as g(L) = l∗(Sub(L))-l∗(Sub(L)) where Sub(L) is the sublattice-lattice of L. We show that if K is a proper homomorphic image of a distributive lattice L, then l∗(Sub(K)) < l∗(Sub(L)); and derive from this result, formulae for l∗(Sub(L)) and g(L) where L is a product of chains
summary:We obtain a simple construction for particular subclasses of several varieties of lattice ex...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
AbstractLet fi = fi(L), 0≤i≤n, be the number of chains (totally ordered sets) of length i contained ...
AbstractFor a finite lattice L, denote by l∗(L) and l∗(L) respectively the upper length and lower le...
AbstractLet K be a class of finite algebras closed under subalgebras, homomorphic images and finite ...
AbstractLet L be a lattice of divisors of an integer (isomorphically, a direct product of chains). W...
AbstractLet L be a finite distributive lattice. It is shown that every interval of L is a de Morgan ...
AbstractSome general results are obtained for any equational class K whose members satisfy the condi...
AbstractThe following conjecture of U Faigle and B Sands is proved: For every number R > 0 there exi...
AbstractWe prove that for each integer l > 1 there exists a number r = r(l) > 1 such that every fini...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
The concept of a residuated mapping relates to the concept of Galois connections; both arise in the ...
AbstractLet P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval ...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
AbstractA partial ordering is defined for monotone projections on a lattice, such that the set of th...
summary:We obtain a simple construction for particular subclasses of several varieties of lattice ex...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
AbstractLet fi = fi(L), 0≤i≤n, be the number of chains (totally ordered sets) of length i contained ...
AbstractFor a finite lattice L, denote by l∗(L) and l∗(L) respectively the upper length and lower le...
AbstractLet K be a class of finite algebras closed under subalgebras, homomorphic images and finite ...
AbstractLet L be a lattice of divisors of an integer (isomorphically, a direct product of chains). W...
AbstractLet L be a finite distributive lattice. It is shown that every interval of L is a de Morgan ...
AbstractSome general results are obtained for any equational class K whose members satisfy the condi...
AbstractThe following conjecture of U Faigle and B Sands is proved: For every number R > 0 there exi...
AbstractWe prove that for each integer l > 1 there exists a number r = r(l) > 1 such that every fini...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
The concept of a residuated mapping relates to the concept of Galois connections; both arise in the ...
AbstractLet P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval ...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
AbstractA partial ordering is defined for monotone projections on a lattice, such that the set of th...
summary:We obtain a simple construction for particular subclasses of several varieties of lattice ex...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
AbstractLet fi = fi(L), 0≤i≤n, be the number of chains (totally ordered sets) of length i contained ...