A polynomial characterization of nondistributive modular lattices
Józef Dudek (1988)
Colloquium Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the Word Problem for the Modular Lattice with Four Free Generators.”
A polynomial characterization of nondistributive modular lattices
A note on relative complements in lattices
Zuzana Morávková (1997)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Two extension theorems. Modular functions on complemented lattices
Hans Weber (2002)
Czechoslovak Mathematical Journal
Similarity:
We prove an extension theorem for modular functions on arbitrary lattices and an extension theorem for measures on orthomodular lattices. The first is used to obtain a representation of modular vector-valued functions defined on complemented lattices by measures on Boolean algebras. With the aid of this representation theorem we transfer control measure theorems, Vitali-Hahn-Saks and Nikodým theorems and the Liapunoff theorem about the range of measures to the setting of modular functions...
The lowest term of the Schottky modular form.
L. Gerritzen, B. Brinkmann (1992)
Mathematische Annalen
Similarity:
Units in the Modular Function Field. V. Iwasawa Theory in the Modular Tower.
Serge Lang, Daniel S. Kubert (1978)
Mathematische Annalen
Similarity:
Equipped graphs and modular lattices attached to them
V. A. Ponomarev (1990)
Banach Center Publications
Similarity:
Strongly modular lattices with long shadow
Gabriele Nebe (2004)
Journal de Théorie des Nombres de Bordeaux
Similarity:
This article classifies the strongly modular lattices with longest and second longest possible shadow.