نتایج جستجو برای: hom
تعداد نتایج: 2065 فیلتر نتایج به سال:
For graphs G and H, a homomorphism from G to H, or H-coloring of G, is an adjacency preserving map from the vertex set of G to the vertex set of H. Our concern in this paper is the maximum number of H-colorings admitted by an n-vertex, d-regular graph, for each H. Specifically, writing hom(G,H) for the number of H-colorings admitted by G, we conjecture that for any simple finite graph H (perhap...
The Hom-1 vesivirus was reported in 1998 following the inadvertent transmission of the animal calicivirus San Miguel sea lion virus to a human host in a laboratory. We characterized the Hom-1 strain and investigated the mechanism by which human cells could be infected. An expression library of 3,559 human plasma membrane proteins was screened for reactivity with Hom-1 virus-like particles, and ...
For a Hopf algebra H over a commutative ring k and a left H-module V, the tensor endofunctors V k - and - kV are left adjoint to some kinds of Hom-endofunctors of _HM. The units and counits of these adjunctions are formally trivial as in the classical case.The category of (bi-) modules over a quasi-Hopf algebra is monoidal and some generalized versions of Hom-tensor relations have been st...
فزضی اّ: تذ یٍتاب تاشذ یًش فزض ک یٌذ l(g) یک گز g فزضی 1( فزض ک یٌذ ( ) [ , ( ( ))] ( ) e g g c var g aut g ? . در اییط رَت تذ یٍتاب است؛ var(g) ) الف . var(g) ? hom(g e(g),l(g)) تاتذار تاشذ، آ گًا g e(g) ب(اگز است. در اییط رَت e(g) هشو لَ در l(g)ِ یک گز تاشذ تغ رَیک g فزضی 2( فزض ک یٌذ var(g) ? hom(g e(g),l(g)) . یک گز تغ رَ هحض غیز آتلی هت اٌ یّ تاشذ. در اییط رَت g فزضی 3( فزض ک یٌذ var(g) ? hom(g,l(g...
The notion of ×-homotopy from [Doca] is investigated in the context of the category of pointed graphs. The main result is a long exact sequence that relates the higher homotopy groups of the space Hom∗(G,H) with the homotopy groups of Hom∗(G,H ). Here Hom∗(G,H) is a space which parameterizes pointed graph maps from G to H (a pointed version of the usual Hom complex), and H is the graph of based...
Let hom(G,H) denote the number of homomorphisms from a graph G to a graph H. In this paper we study the number of homomorphisms of trees into a path, and prove that hom(Pm, Pn) ≤ hom(Tm, Pn) ≤ hom(Sm, Pn), where Tm is any tree on m vertices, and Pm and Sm denote the path and star on m vertices, respectively. This completes the study of extremal problems concerning the number of homomorphisms be...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید