Some Properties of Quasi-keep-range Operators and Their Applications

ＳｏｍｅＰｒｏｐｅｒｔｉｅｓｏｆＱｕａｓｉ┐ｋｅｅｐ┐ｒａｎｇｅＯｐｅｒａｔｏｒｓａｎｄＴｈｅｉｒＡｐｐｌｉｃａｔｉｏｎｓＬａｉＣｈｕｎｈｕｉ（赖春晖）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＺｈａｎｇｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｅｇｅ，...     

Hyers-Ulam-Rassias stability of homomorphisms in quasi-Banach algebras associated to the Pexiderized Cauchy functional equation

In this paper, we prove the Hyers-Ulam-Rassias stability of homomorphisms in quasi-Banach algebras associated to the Pexiderized Cauchy functional equation. This is applied to investigate homomorphisms between quasi-Banach algebras. The concept of Hyers-Ulam-Rassias stability originated from Th.M. Rassias' stability theorem that appeared in his paper [Th.M. Rassias, On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc. 72 (1978) 297-300].     

TL—子环上的TL—子模的格

研究TL－子环上TL－子模形成的格及其子格的性质,给出这些格之间的同态与同构定理。     

Application of homomorphism to secure image sharing

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images (l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.     

Approximately spectrum-preserving maps

Let X and Y be superreflexive complex Banach spaces and let B(X) and B(Y) be the Banach algebras of all bounded linear operators on X and Y, respectively. If a bijective linear map Φ:B(X)→B(Y) almost preserves the spectra, then it is almost multiplicative or anti-multiplicative. Furthermore, in the case where X=Y is a separable complex Hilbert space, such a map is a small perturbation of an automorphism or an anti-automorphism.     

Conceptual metaphors for isomorphism and homomorphism: Instructors’ descriptions for themselves and when teaching

Group isomorphism and homomorphism are topics central to abstract algebra, yet research on instructors’ views of these concepts is limited. Based on interviews from two instructors as well as classroom video from eight class periods, this paper examines the language used to discuss isomorphism and homomorphism. Language used by instructors in interviews and classroom settings are identified and classified into four main categories: formal definition, mapping, sameness, and combinations of sameness and mapping language. How the two instructors drew on language classified into those four categories in the interview and instruction settings are examined for isomorphism and homomorphism. Similarities and differences between the interview and instruction contexts reveal the wide variety of ways of understanding isomorphism and homomorphism as well as a research need to examine mathematicians’ content knowledge in more than one context.     

Multicoloring and Mycielski construction

The generalized Mycielskians of graphs (also known as cones over graphs) are the natural generalization of the Mycielskians of graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer p?0, one can transform G into a new graph μ_p(G), the p-Mycielskian of G. In this paper, we study the kth chromatic numbers χ_k of Mycielskians and generalized Mycielskians of graphs. We show that χ_k(G)+1?χ_k(μ(G))?χ_k(G)+k, where both upper and lower bounds are attainable. We then investigate the kth chromatic number of Mycielskians of cycles and determine the kth chromatic number of p-Mycielskian of a complete graph K_n for any integers k?1, p?0 and n?2. Finally, we prove that if a graph G is a/b-colorable then the p-Mycielskian of G, μ_p(G), is (at+b^p+1)/bt-colorable, where . And thus obtain graphs G with m(G) grows exponentially with the order of G, where m(G) is the minimal denominator of a a/b-coloring of G with χ_f(G)=a/b.     

Algebras of fuzzy sets

In this paper we investigate two kinds of algebras of fuzzy sets, which are obtained by using Zadeh's extension principle. We give conditions under which a homomorphism between two algebras induces a homomorphism between corresponding algebras of fuzzy sets. We prove that if the structure of truth values is a complete residuated lattice, the induced algebra of a subalgebra of an algebra can be embedded into the induced algebra of fuzzy sets of . For direct products we give conditions under which the direct product of algebras of fuzzy sets could be embedded into the algebra of fuzzy sets of the direct product. In the case of homomorphisms and direct products, the two kinds of algebras of fuzzy sets behave in different ways.