Each finite closure system, whence each finite lattice, can be described in terms of"
implicational bases"(called" covers of functional dependencies" in relational database …

Baer [1] observed that modular lattices of finite length (for example subgroup lattices of
abelian groups) can be conceived as subspace lattices of a projective geometry structure on …

When is a finite modular lattice cover preserving embeddable into a partition lattice? We
give some necessary, and slightly sharper sufficient conditions. For example, the class of …

It is not known which finite graphs occur as induced subgraphs of a hypercube. This is
relevant in the theory of parallel computing. The ordered version of the problem is: Which …

A structural matrix algebra R of n× n matrices over a field F has a distributive lattice Lat (R) of
invariant subspaces⊆ Fn. This and related known results are reproven here in a fresh way …

The present state of art in the theory of modular lattices is to a great extent due to Alan Day's
contributions. The purpose of the present paper is to outline the most important ones and …

We present notions of module over a universal algebra, and linear representation of a
universal algebra, which have gained currency with categorical algebraists, we give several …

If two subspaces V and V′ of a sesquilinear space E are congruent (ie, there is an isometry
Φ: E→ E with Φ (V)= V′) then their corresponding quadratic lattices V (V, E) and V (V′, E) …

Tight embedding of modular lattices into partition lattices: progress and program Page 1
Algebra Univers. (2018) 79:79 c© 2018 Springer Nature Switzerland AG 1420-8911/18/040001-49 …

Let V be a vectorspace and let 5p~ V (p EP) be finitely many subspaces. How big is the
modular lattice£(5p I pEP) generated by these subspaces, ie. how many subspaces does …