Results 21 to 30 of about 10,888 (264)

Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter [PDF]

open access: yesJournal of Information Security, 2022
Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajtai’s construction of a collision resistant Hash function (see \cite{M1} and \cite{M2}) and in Gentry’s construction of fully homomorphic encryption (see \cite{G}).
Zhiyong Zheng   +3 more
openaire   +2 more sources

Symmetries of the k-bounded partition lattice [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
We generalize the symmetry on Young's lattice, found by Suter, to a symmetry on the $k$-bounded partition lattice of Lapointe, Lascoux and Morse.
Chris Berg, Mike Zabrocki
doaj   +1 more source

A Note on Congruences of Infinite Bounded Involution Lattices

open access: yesScientific Annals of Computer Science, 2021
We prove that an infinite (bounded) involution lattice and even pseudo-Kleene algebra can have any number of congruences between 2 and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals as elements or ...
Claudia Muresan
doaj   +1 more source

On Join-Dense Subsets of Certain Families of Aggregation Functions

open access: yesMathematics, 2022
Several important classes of aggregation functions defined on a bounded lattice form a lattice with respect to the pointwise operations of join and meet, respectively. The lattice structure of such classes is usually very complex; thus, it is very useful
Radomír Halaš   +2 more
doaj   +1 more source

On uninorms and nullnorms on direct product of bounded lattices

open access: yesOpen Physics, 2016
We will study uninorms on the unit square endowed with the natural partial order defined coordinate-wise. We will show that we can choose arbitrary pairs of incomparable elements, (a, e) and construct a uninorm whose neutral element is e and annihilator ...
Kalina Martin
doaj   +1 more source

Martingale-like sequences in Banach lattices

open access: yesModern Stochastics: Theory and Applications, 2018
Martingale-like sequences in vector lattice and Banach lattice frameworks are defined in the same way as martingales are defined in [Positivity 9 (2005), 437–456].
Haile Gessesse, Alexander Melnikov
doaj   +1 more source

On lattice of Basic Z-Ideals

open access: yesپژوهش‌های ریاضی, 2021
For an f-ring  with bounded inversion property, we show that  , the set of all basic z-ideals of , partially ordered by inclusion is a bounded distributive lattice.
Ali Taherifar
doaj  

The small intersection graph of filters of a bounded distributive lattice [PDF]

open access: yesJournal of Mahani Mathematical Research, 2023
Let $L$ be a lattice with $1$ and $0$. The small intersection graph of filters of $L$, denoted by $\Gamma(L)$, is defined to be a graph whose vertices are in one to one correspondence with all non-trivial filters of $L$ and two distinct vertices are ...
Shahabaddin Ebrahimi Atani   +2 more
doaj   +1 more source

On Alexandrov lattices

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1993
By an Alexandrov lattice we mean a δ normal lattice of subsets of an abstract set X, such that the set of ℒ-regular countably additive bounded measures is sequentially closed in the set of ℒ-regular finitely additive bounded measures on the algebra ...
Albert Gorelishvili
doaj   +1 more source

Efficient Lattice Gadget Decomposition Algorithm With Bounded Uniform Distribution

open access: yesIEEE Access, 2021
A gadget decomposition algorithm is commonly used in many advanced lattice cryptography applications which support homomorphic operations over ciphertexts to control the noise growth.
Sohyun Jeon   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy