Results 121 to 130 of about 6,941 (163)

Programmable Edge-to-Edge Assembly of RNA Nanostructures

open access: yes
Geary C   +4 more
europepmc   +1 more source

Lattice uniformities and modular functions on orthomodular lattices

Order, 1995
Traynor's decomposition for group-valued set functions is generalized to exhaustive modular functions. It is shown that the lattice of exhaustive (lattice-) uniformities on an orthomodular lattice \(L\) is a complete Boolean algebra isomorphic to the centre of a quotient completion of \(L\).
Hans Weber, Weber Hans
exaly   +2 more sources

Modular lattice signatures, revisited

Designs, Codes, and Cryptography, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeffrey Hoffstein   +2 more
exaly   +3 more sources

Complemented Modular Lattices

Canadian Journal of Mathematics, 1959
1.1 This paper gives a lattice theoretic investigation of “finiteness“ and “continuity of the lattice operations” in a complemented modular lattice. Although we usually assume that the lattice is-complete for some infinite,3we do not require completeness and continuity, as von Neumann does in his classical memoir on continuous geometry (3); nor do we ...
Amemiya, Ichiro, Halperin, Israel
openaire   +1 more source

Modular C11 lattices and lattice preradicals

Journal of Algebra and Its Applications, 2017
This paper deals with properties of modular [Formula: see text] lattices involving hereditary preradicals on hereditary classes of modular lattices. Applications are given to Grothendieck categories and module categories equipped with hereditary torsion theories.
Albu, Toma, Iosif, Mihai
openaire   +1 more source

Homogeneous Modular Lattices are Distributive

Order, 2015
A structure \(A\) is homogeneous if any partial isomorphism between finitely generated substructures can be extended to an automorphism of the structure \(A\). \textit{A. Abogatma} and \textit{J. K. Truss} [Order 32, No. 2, 239--243 (2015; Zbl 1348.06004)] have constructed uncountably many contable homogeneous lattices.
openaire   +2 more sources

The Comparability Graph of a Modular Lattice

Combinatorica, 1998
The author shows that the comparability graph of a finite lattice \(L\) of rank \(d-1\) \((\geq 3)\) is \(d\)-connected if there is an interval \([x,y] \subset L\) of rank 3 with \(\mu_L (x,y) = 0\) (\(\mu_L\) is the Möbius function of \(L\)). He uses fundamental chains of Cohen-Macaulay partially ordered sets.
openaire   +1 more source

Congruence lattices of modular lattices

Publicationes Mathematicae Debrecen, 1993
It is a well-known result of R. P. Dilworth and of G. Grätzer and the author that every finite distributive lattice is the congruence lattice of some finite lattice. In addition, finite modular lattices have Boolean congruence lattices. In the paper under review the author gives a new proof of the following theorem: Every finite distributive lattice is
openaire   +1 more source

Home - About - Disclaimer - Privacy