نتایج جستجو برای: bounded fuzzylinear order homomorphism
تعداد نتایج: 965870 فیلتر نتایج به سال:
Let Gn,k denote the Kneser graph whose vertices are the n-element subsets of a (2n + k)-element set and whose edges are the disjoint pairs. In this paper we prove that for any non-negative integer s there is no graph homomorphism from G4,2 to G4s+1,2s+1. This confirms a conjecture of Stahl in a special case.
Comparing genomic properties of multiple species at varying evolutionary distances is a powerful approach for studying biological and evolutionary principles. In the context of comparative analysis of protein–protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex. We show that the problem is polynomial-time solvable provided that each pr...
Abstract. We combine the notion of norming algebra introduced by Pop, Sinclair and Smith with a result of Pisier to show that if A1 and A2 are operator algebras, then any bounded epimorphism of A1 onto A2 is completely bounded provided that A2 contains a norming C ∗-subalgebra. We use this result to give some insights into Kadison’s Similarity Problem: we show that every faithful bounded homomo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید