نتایج جستجو برای: jordan homomorphism

تعداد نتایج: 17118  

In this paper, we investigate the generalized Hyers-Ulam-Rassias and the Isac and Rassias-type stability of the conditional of orthogonally ring $*$-$n$-derivation and orthogonally ring $*$-$n$-homomorphism on $C^*$-algebras. As a consequence of this, we prove the hyperstability of orthogonally ring $*$-$n$-derivation and orthogonally ring $*$-$n$-homomorphism on $C^*$-algebras.

Journal: :Journal of Combinatorial Theory, Series A 2010

Journal: :Czechoslovak Mathematical Journal 2000

Journal: :LMS Journal of Computation and Mathematics 2012

Journal: :International Journal of Mathematics and Mathematical Sciences 1995

Journal: :Inf. Process. Lett. 2014
Pawel Rzazewski

For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...

Journal: :CoRR 2018
Angela Wuu

We define the Homomorphism Extension (HomExt) problem: given a group G, a subgroup M ≤ G and a homomorphism φ : M → H , decide whether or not there exists a homomorphism φ̃ : G → H extending φ, i.e., φ̃|M = φ. This problem arose in the context of list-decoding homomorphism codes but is also of independent interest, both as a problem in computational group theory and as a new and natural problem i...

2007
Tommy Färnqvist Peter Jonsson

We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of deciding whether a structure A ∈ C has a homomorphism to a given arbitrary structure B, when each element in A is only allowed a certain subset of elements of B as its image. We prove, under a certain complexity-theore...

2009
Mitsuyasu Hashimoto

We discuss Matijevic–Roberts type theorem on strong F -regularity, F -purity, and Cohen–Macaulay F -injective (CMFI for short) property. Related to this problem, we also discuss the base change problem and the openness of loci of these properties. In particular, we define the notion of F -purity of homomorphisms using Radu–André homomorphisms, and prove basic properties of it. We also discuss a...

Journal: :Random Struct. Algorithms 2000
Itai Benjamini Gideon Schechtman

Bounds on the range of random graph homomorphism into Z, and the maximal height difference of the Gaussian random field, are presented.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید