Results 21 to 30 of about 6,544 (263)
S-extremal strongly modular lattices [PDF]
S-extremal strongly modular lattices maximize the minimum of the lattice and its shadow simultaneously. They are a direct generalization of the s-extremal unimodular lattices defined in [6]. If the minimum of the lattice is even, then the dimension of an s-extremal lattices can be bounded by the theory of modular forms.
Nebe, Gabriele, Schindelar, Kristina
openaire +2 more sources
Categorical Dualities for Some Two Categories of Lattices: An Extended Abstract
The categorical dualities presented are: (first) for the category of bi-algebraic lattices that belong to the variety generated by the smallest non-modular lattice with complete (0,1)-lattice homomorphisms as morphisms, and (second) for the category of ...
Wiesław Dziobiak, Marina Schwidefsky
doaj +1 more source
Fuzzy Distributive Pairs in Fuzzy Lattices
We generalize the concept of a fuzzy distributive lattice by introducing the concepts of a fuzzy join-distributive pair and a fuzzy join-semidistributive pair in a fuzzy lattice.
Wasadikar Meenakshi, Khubchandani Payal
doaj +1 more source
Modular Substructures in Pseudomodular Lattices.
Summary: Pseudomodular lattices have been used by the first author and \textit{L. Lovasz} [Combinatorica 7, 39-48 (1987; Zbl 0627.05016)] in order to investigate combinatorial properties of algebraic matroids and were further analyzed by \textit{A. Björner} and \textit{L. Lovasz} [Acta Sci. Math. 51, No. 3/4, 295-308 (1987; Zbl 0643.05023)].
Kern, W., DRESS, A., Hochstättler, W.
openaire +4 more sources
Segment LLL Reduction of Lattice Bases Using Modular Arithmetic
The algorithm of Lenstra, Lenstra, and Lovász (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of O(n) using modular arithmetic.
Sanjay Mehrotra, Zhifeng Li
doaj +1 more source
Memory‐constrained implementation of lattice‐based encryption scheme on standard Java Card platform
The lattice‐based encryption scheme has high efficiency and reliability, and it can be run on small devices with limited memory capacity and computational resources such as sensor nodes or smart cards.
Ye Yuan +4 more
doaj +1 more source
Nearly Modular Orthocomplemented Lattices [PDF]
Introduction. Let L be a complete, orthocomplemented lattice. We say that L is a dimension lattice if L is weakly modular and there is an equivalence relation on L satisfying the axioms A, B, C, and D' of Loomis [5]. We say that L is locally finite if every element of L is the join of finite elements.
openaire +2 more sources
Locally modular lattices and locally distributive lattices [PDF]
A locally modular (resp. locally distributive) lattice is a lattice with a congruence relation and each of whose equivalence class has sufficiently many elements and is a modular (resp. distributive) sublattice. Both the lattice of all closed subspaces of a locally convex space and the lattice of projections of a locally finite von Neumann algebra are ...
openaire +1 more source
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
Cyclotomic modular lattices [PDF]
Several interesting lattices can be realised as ideal lattices over cyclotomic fields : some of the root lattices, the Coxeter-Todd lattice, the Leech lattice, etc. Many of these are modular in the sense of Quebbemann. The aim of the present paper is to determine the cyclotomic fields over which there exists a modular ideal lattice.
openaire +1 more source

