نتایج جستجو برای: nonzero complex homomorphism

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

2011
Suohai Fan Hongjian Lai Ju Zhou

For a graph G, let     max : is an edge cut of b G D D G  . For graphs G and H, a map     :V G V H   is a graph homomorphism if for each   e uv E G   ,       u v E H    . In 1979, Erdös proved by probabilistic methods that for p ≥ 2 with

Journal: :CoRR 2009
Robert Engström Tommy Färnqvist Peter Jonsson Johan Thapper

A graph homomorphism is a vertex map which carries edges from a source graph to edgesin a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem(MAX H -COL) are edge-weighted graphs G and the objective is to find a subgraph of G that hasmaximal total edge weight, under the condition that the subgraph has a homomorphism to H ;note that for H = Kk th...

2009
Huitao Feng Weiping Li Weiping Zhang

For two complex vector bundles admitting a homomorphism with isolated singularities between them, we establish a Poincaré-Hopf type formula for the difference of the Chern character numbers of these two vector bundles. As a consequence, we extend the original Poincaré-Hopf index formula to the case of complex vector fields.

2006
Taoyang Wu

Following the last talk on graph homomorphisms, we continue to discuss some examples of graph homomorphisms. But this time we will focus on some models, that is, the homomorphism G → H for the graph H with fixed weights. The main reference is Section 1 in [2].

2001
Graham R. Brightwell Peter Winkler

We show that if a graph H is k-colorable, then (k−1)-branching walks on H exhibit long range action, in the sense that the position of a token at time 0 constrains the configuration of its descendents arbitrarily far into the future. This long range action property is one of several investigated herein; all are similar in some respects to chromatic number but based on viewing H as the range, in...

2007
THOMAS BRITZ

A matrix is free, or generic, if its nonzero entries are algebraically independent. Necessary and sufficient combinatorial conditions are presented for a complex free matrix to have a free Moore-Penrose inverse. These conditions extend previously known results for square, nonsingular free matrices. The result used to prove this characterization relates the combinatorial structure of a free matr...

2005
TAKESHI MIURA

We prove that a Jordan homomorphism from a Banach algebra into a semisimple commutative Banach algebra is a ring homomorphism. Using a signum effectively, we can give a simple proof of the Hyers-Ulam-Rassias stability of a Jordan homomorphism between Banach algebras. As a direct corollary, we show that to each approximate Jordan homomorphism f from a Banach algebra into a semisimple commutative...

2012
Wei Ma Zheng-Jian Bai

In this paper, we study the sensitivity and second order perturbation expansions of simple nonzero finite generalized singular values of a complex matrix pair, which is analytically dependent on several parameters. Our results generalize the perturbation analysis given by Sun [J. Comput. Math., 6 (1988), pp. 258–266] for simple nonzero singular values.

Journal: :European Journal of Combinatorics 2011

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

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