نتایج جستجو برای: ary homomorphism
تعداد نتایج: 8027 فیلتر نتایج به سال:
Binary perfect sequences and their variations have applications in various areas such as signal processing, synchronizing and distance measuring radars. This survey discusses their p-ary analogs, other variations and related matters. Many new results are also presented. Introduction: In recent years there have been many publications on time-discrete one and twodimensional sequences and arrays w...
this paper continues the investigation of the rst author begun in part one. the hereditary properties of n-homomorphism amenability for banach algebras are investigated and the relations between n-homomorphism amenability of a banach algebra and its ide- als are found. analogous to the character amenability, it is shown that the tensor product of two unital banach algebras is n-homomorphism am...
The aim of this research work is to define and characterize a new class of n-ary multialgebra that may be called canonical (m, n)&minus hypermodules. These are a generalization of canonical n-ary hypergroups, that is a generalization of hypermodules in the sense of canonical and a subclasses of (m, n)&minusary hypermodules. In addition, three isomorphism theorems of module theory and canonical ...
We show that certain canonical realizations of the complexes Hom(G,H) and Hom+(G,H) of (partial) graph homomorphisms studied by Babson and Kozlov are in fact instances of the polyhedral Cayley trick. For G a complete graph, we then characterize when a canonical projection of these complexes is itself again a complex, and exhibit several well-known objects that arise as cells or subcomplexes of ...
The vertex boundary-width problem (for short VBWP) is to determine the value of vbw(G)=max1 |V |minS⊆V,|S|= |N(S)| for a given graph G= (V ,E), where N(S)= {v / ∈ S|v is a neighbor of u for some u ∈ S}. In this paper, we give a lower bound for vertex boundary-width of complete k-ary trees. © 2007 Elsevier B.V. All rights reserved.
...
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.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید