A remark on $\lambda$-regular orthomodular lattices

Rogalewicz, Vladimír. "A remark on $\lambda $-regular orthomodular lattices." Aplikace matematiky 34.6 (1989): 449-452. <http://eudml.org/doc/15600>.

@article{Rogalewicz1989,
abstract = {A finite orthomodular lattice in which every maximal Boolean subalgebra (block) has the same cardinality $k$ is called $\lambda $-regular, if each atom is a member of just $\lambda $ blocks. We estimate the minimal number of blocks of $\lambda $-regular orthomodular lattices to be lower than of equal to $\lambda ^2$ regardless of $k$.},
author = {Rogalewicz, Vladimír},
journal = {Aplikace matematiky},
keywords = {Greechie diagram; finite orthomodular lattice; maximal Boolean subalgebra; Greechie diagram; finite orthomodular lattice; maximal Boolean subalgebra},
language = {eng},
number = {6},
pages = {449-452},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A remark on $\lambda $-regular orthomodular lattices},
url = {http://eudml.org/doc/15600},
volume = {34},
year = {1989},
}

TY - JOUR
AU - Rogalewicz, Vladimír
TI - A remark on $\lambda $-regular orthomodular lattices
JO - Aplikace matematiky
PY - 1989
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 34
IS - 6
SP - 449
EP - 452
AB - A finite orthomodular lattice in which every maximal Boolean subalgebra (block) has the same cardinality $k$ is called $\lambda $-regular, if each atom is a member of just $\lambda $ blocks. We estimate the minimal number of blocks of $\lambda $-regular orthomodular lattices to be lower than of equal to $\lambda ^2$ regardless of $k$.
LA - eng
KW - Greechie diagram; finite orthomodular lattice; maximal Boolean subalgebra; Greechie diagram; finite orthomodular lattice; maximal Boolean subalgebra
UR - http://eudml.org/doc/15600
ER -