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
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
AbstractFor a finite lattice L, denote by l∗(L) and l∗(L) respectively the upper length and lower le...
AbstractLet L be a lattice of divisors of an integer (isomorphically, a direct product of chains). W...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
Let L be a finite lattice and let L ̂ = L − {0̂, 1̂}. It is shown that if the order complex ∆(L̂) s...
In this paper we continue our study of lattices in the automorphisms groups of products of trees ini...
Let α=(a,b,…) be a composition. Consider the associated poset F(α), called a fence, whose covering r...
AbstractA class L of (finite) ranked lattices has the regressive chain property iff for every positi...
ABSTRACT. In this paper we are concerned with lexicographic products of ordered sets, which are much...
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
Fix nonnegative integers n1,…,nd and let L denote the lattice of integer points (a1,…,ad)∈Zd satisf...
AbstractEvery completely distributive complete lattice is a subdirect product of copies of the latti...
AbstractWe order the ordering relation of an arbitrary poset P component-wise by itself, obtaining a...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
AbstractFor a finite lattice L, denote by l∗(L) and l∗(L) respectively the upper length and lower le...
AbstractLet L be a lattice of divisors of an integer (isomorphically, a direct product of chains). W...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
Let L be a finite lattice and let L ̂ = L − {0̂, 1̂}. It is shown that if the order complex ∆(L̂) s...
In this paper we continue our study of lattices in the automorphisms groups of products of trees ini...
Let α=(a,b,…) be a composition. Consider the associated poset F(α), called a fence, whose covering r...
AbstractA class L of (finite) ranked lattices has the regressive chain property iff for every positi...
ABSTRACT. In this paper we are concerned with lexicographic products of ordered sets, which are much...
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
Fix nonnegative integers n1,…,nd and let L denote the lattice of integer points (a1,…,ad)∈Zd satisf...
AbstractEvery completely distributive complete lattice is a subdirect product of copies of the latti...
AbstractWe order the ordering relation of an arbitrary poset P component-wise by itself, obtaining a...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...