Results 71 to 80 of about 153,244 (275)
SMARANDACHE NEAR-RINGS AND THEIR GENERALIZATIONS [PDF]
In this paper we study the Smarandache semi-near-ring and nearring, homomorphism, also the Anti-Smarandache semi-near-ring. We obtain some interesting results about them, give many examples, and pose some problems.
Vasantha Kandasamy, W.B.
core +1 more source
Characterization of Pseudo n-Jordan Homomorphisms Between Unital Algebras
Let A and B be Banach algebras and B be a right A-module. In this paper, under special hypotheses we prove that every pseudo (n+1)-Jordan homomorphism f:A----> B is a pseudo n-Jordan homomorphism and every pseudo n-Jordan homomorphism is an n-Jordan ...
Abbas Zivari-Kazempour, Abasalt Bodaghi
doaj
The oriented chromatic number of edge-amalgamation of cycle graph
An oriented k − coloring of an oriented graph G⃗ is a partition of V(G⃗) into k color classes such that no two adjacent vertices belong to the same color class, and all the arcs linking the two color classes have the same direction.
Dina Eka Nurvazly+2 more
doaj +1 more source
On Homomorphism and Cartesian Products of Intuitionistic Fuzzy PMS-subalgebra of a PMS-algebra
In this paper, we introduce the notion of intuitionistic fuzzy PMS-subalgebras under homomorphism and Cartesian product and investigate several properties.
Beza Lamesgin Derseh+2 more
doaj +1 more source
Inspired by an analogous result of Arnautov about isomorphisms, we prove that all continuous surjective homomorphisms of topological groups f :G → H can be obtained as restrictions of open continuous surjective homomorphisms \tilde f : \tilde G → H
openaire +4 more sources
Multigraph limits, unbounded kernels,and Banach space decorated graphs [PDF]
We present a construction that allows us to define a limit object of Banach space decorated graph sequences in a generalized homomorphism density sense.
Kunszenti-Kovács, Dávid+2 more
core +2 more sources
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
Factoring Continuous Characters Defined on Subgroups of Products of Topological Groups
This study is on the factorization properties of continuous homomorphisms defined on subgroups (or submonoids) of products of (para)topological groups (or monoids).
Mikhail G. Tkachenko
doaj +1 more source
2-local triple homomorphisms on von Neumann algebras and JBW$^*$-triples [PDF]
We prove that every (not necessarily linear nor continuous) 2-local triple homomorphism from a JBW$^*$-triple into a JB$^*$-triple is linear and a triple homomorphism.
Antonio+4 more
core
Homomorphism reconfiguration via homotopy [PDF]
We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring throughout ...
Marcin Wrochna
semanticscholar +1 more source