Results 131 to 140 of about 6,941 (163)
Some of the next articles are maybe not open access.
The Imbedding Problem for Modular Lattices
The Annals of Mathematics, 1944It is trivially true that an arbitrary lattice may be imbedded in a complemented lattice. We need only adjoin a unit and null elements if they do not already exist and a single element which is a complement of each of the elements not the unit of null element.
Hall, M., Dilworth, R. P.
openaire +1 more source
Invariant elements in a modular lattice
Functional Analysis and Its Applications, 1984Following \textit{I. M. Gelfand} and \textit{V. A. Ponomarev} [Colloq. Math. Soc. János Bolyai 5, 163-237 (1972; Zbl 0294.15002)] a system \(S=(V;E_ 1,...,E_ r)\) of a finite-dimensional vector space V and of subspaces \(E_ 1,...,E_ r\) has defect \(\rho(S)=\sum \dim E_ i-2 \dim V.\) A system S is said to be decomposable if there exist subspaces \(P_ 1,
openaire +1 more source
Corrigendum: Gluings of Modular Lattices
Order, 2006In Day and Hermann (Order, 5:85–101, 1988) it has been stated that for every S-cover of a lattice L there is an extension L′ of L in the variety of L and a bounded S-cover of L′ which restricts to the given S-cover and has each block L′(x) in the variety of L(x). A correct proof of this statement is given, here.
openaire +1 more source
Modular technique to construct lightweight CFRP lattice structures
Thin-Walled Structures, 2023Hualin Fan, Wenhao Wang
exaly
Some applications of modular convergence in vector lattice setting
Sampling Theory, Signal Processing, and Data Analysis, 2022Anna Rita Sambucini +2 more
exaly