In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...

in this paper, our purpose is twofold. firstly, the tensor andresiduum operations on $l-$nested systems are introduced under thecondition of complete residuated lattice. then we show that$l-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. thus the new representation theorem of$l-$subsets on complete re...

let $r$ be a commutative ring and let $m$ be an $r$-module. we define the small intersection graph $g(m)$ of $m$ with all non-small proper submodules of $m$ as vertices and two distinct vertices $n, k$ are adjacent if and only if $ncap k$ is a non-small submodule of $m$. in this article, we investigate the interplay between the graph-theoretic properties of $g(m)$ and algebraic properties of $m...

We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem with n parties, that provides information theoretic security, when t < n 3 parties are corrupted by an active adversary having unbounded computing power. In [16], the authors claimed that their protocol takes six roun...

This article indicates another set-theoretic formula, solely in terms of union and intersection, for the set limits any given sequence (net, general) an arbitrary T 1 space; this representation particular gives a new characterization space.

betweenness, geometry, lines, polar coordinates, trilinear coordinates We consider straight line drawings. From a graph theoretic point of view these are plane graphs with a set of preferred paths. This graph is expressed in geometric terms through the consideration of the betweenness of the points of intersection along each of the lines. If we fix a reference system for polar coordinates, we c...

Existing protocols for private set intersection are based on homomorphic public-key encryption and the technique of representing sets as polynomials in the cryptographic model. Based on the ideas of these protocols and the two-dimensional verifiable secret sharing scheme, we propose a protocol for private set intersection in the informationtheoretic model. By representing the sets as polynomial...