Results 1 to 10 of about 6,562 (88)
On Weil homomorphism in locally free sheaves over structured spaces
Inspired by the work of Heller and Sasin [1], we construct in this paper Weil homomorphism in a locally free sheaf W of ϕ-fields [2] over a structured space.
Falkiewicz Ewa, Sasin Wiesław
doaj +1 more source
Similarity Calculation Based on Homomorphic Encryption [PDF]
In recent years, although some homomorphic encryption algorithms have been proposed to provide additive homomorphic encryption and multiplicative homomorphic encryption. However, similarity measures are required for searches and queries under homomorphic encrypted ciphertexts.
arxiv +1 more source
Homomorphisms of the lattice of slowly oscillating functions on the half-line [PDF]
We study the space $H(\SO)$ of all homomorphisms of the vector lattice of all slowly oscillating functions on the half-line $\HH=[0,\infty)$. In contrast to the case of homomorphisms of uniformly continuous functions, it is shown that a homomorphism in $H(\SO)$ which maps the unit to zero must be zero-homomorphism. Consequently, we show that the space $
arxiv +1 more source
A generalization of anti-homomorphisms [PDF]
We prove some nice properties of anti-homomorphisms, some of which are analogic to that of homomorphisms. Meanwhile, we develop a new kind of composition called $*$-composition such that the $*$-composition of two anti-homomorphisms is still an anti-homomorphism.
arxiv
Fuzzy Riesz homomorphism on fuzzy Riesz space [PDF]
In this paper, we give some properties of fuzzy Riesz homomorphism on fuzzy Riesz space. We give definitions of fuzzy quotient spaces, and some characterizations of fuzzy Archimedean quotient spaces. We prove the properties which fuzzy Riesz homomorphism is fuzzy order continuous, and study the extension of fuzzy lattice homomorphism and the extension ...
arxiv
Graph Homomorphisms Based On Particular Total Colorings of Graphs and Graphic Lattices [PDF]
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total colorings together for designing new types of graph homomorphisms: totally-colored graph homomorphisms, graphic-lattice ...
arxiv
Verifiable encodings in multigroup fully homomorphic encryption [PDF]
This article presents the application of homomorphic authenticators, replication encodings to be precise, to multigroup fully homomorphic encryption schemes. Following the works of Gennaro and Wichs on homomorphic authenticators in combination with the work of multigroup schemes by Kwak et al.
arxiv
Smooth homomorphisms admit noetherian reductions [PDF]
We give a short proof that any smooth (means formally smooth and finitely presented) homomorphism of rings can be obtained by base change from a smooth homomorphism of noetherian rings. Together with the elegant short proof by J. Conde-Lago that smooth homomorphisms of noetherian rings are flat, this gives a short and elementary proof of the theorem of
arxiv
Extending Johnson's and Morita's homomorphisms to the mapping class group [PDF]
We extend certain homomorphisms defined on the higher Torelli subgroups of the mapping class group to crossed homomorphisms defined on the entire mapping class group. In particular, for every $k\geq 2$, we construct a crossed homomorphism $\epsilon_k$ which extends Morita's homomorphism $\tilde \tau_k$ to the entire mapping class group.
arxiv +1 more source
Homomorphic Preimages of Geometric Cycles [PDF]
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H. A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in ...
arxiv +1 more source