On centrally symmetric graphs
In this note we extend results on the covering graphs of modular lattices (Zelinka) and semimodular lattices (Gedeonova, Duffus and Rival) to the covering graph of certain graded lattices.
On certain congruence lattices of finite unary algebras
On Certain Generalized Probability Domains
On certain lattice-ordered semigroups.
On certain localic nuclei
On chains and posets within the power set of a continuum.
On chains in -algebras
On chains whose power semigroups are lattices.
On cheating immune secret sharing.
On closed lattices
On closure operators on monoids
On collections of almost disjoint families
On colored set partitions of type B n
Generalizing Reiner’s notion of set partitions of type B n, we define colored B n-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored B n-partitions, we get the exact formulas for the expectation and variance of the number of non-zero-blocks in a random colored B n-partition. We find an asymptotic expression of the total number of colored B n-partitions up to an error of O(n −1/2log7/2 n], and prove that the centralized and...
On compactness of lattices.
On compatible and order-preserving functions on lattices
On complemented strong lattices
On complete lattice ordered groups with strong units
On complete lattice ordered groups with two generators. I.
On complete lattice ordered groups with two generators. II.
On complete -algebras