Báo cáo toán học: "Mapping cones and exact sequences in KK-theory " pptx

... h 1" alt =""

Ngày tải lên: 05/08/2014, 15:21

... h 1" alt =""

Ngày tải lên: 05/08/2014, 10:20

... other hand, bearing in mind that µ and ν are in the interior of the same Weyl chamber C,andwµ = µ + and wν = ν + are dominant, we may use Proposition 4.4 to compare the ranks of x(µ)andx(ν) in the ... , including the cross section X and the subspace V .Moreover,V also carries a standard ordering relative to the root system Φ; however, these two “standard” orderings of V coincide:...

Ngày tải lên: 07/08/2014, 08:22

... 4-cycle containing both v 1 and v 2 or containing both v 3 and v 4 . Proof. Suppose, to the contrary, that there is a 4-cycle containing both v 1 and v 2 or containing both v 3 and v 4 . By symmetry, ... H v contains an edge {v 1 ,v 2 ,v 5 } containing v 1 and v 2 ,and an edge {v 3 ,v 4 ,v 5 } containing v 3 and v 4 . Since the edges N(v i ), 1 ≤ i ≤ 4, are deleted from H G when...

Ngày tải lên: 07/08/2014, 13:21

... k-dominating set of G if the distance between each vertex u ∈ V − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in ... the minimum cardinality taken over all maximal k-irredundant sets of vertices of G. In 1975, Meir and Moon [10] introduced the concept of a k-dominating set (called a ‘k-covering’ in...

Ngày tải lên: 07/08/2014, 15:22

... maximal independent set and that in every graph, γ(G) ≤ i(G) ≤ β(G) where γ(G) and i(G) are respectively the minimum cardinality of a dominating set and of an independent dominating set and β(G) ... Hedetniemi and S. T. Hedetniemi, Alliances in graphs, JCMCC 48 (2004), 157-177. [7] N. Linial, D. Peleg, Y. Rabinovich and M. Saks, Sphere packing and local majorities in graph...

Ngày tải lên: 07/08/2014, 21:20

... Diestel and D. K¨uhn. On in nite cycles II. Combinatorica , 24:91–116, 2004. [15] R. Diestel and D. K¨uhn. Topological paths, cycles and spanning trees in infinite graphs. Europ. J. Combinatorics, ... every inner point of an edge of G is the image of exactly one point of S 1 (thus, every edge is traversed exactly once, and in a “straight” manner). A trail in a multigraph G is a...

Ngày tải lên: 07/08/2014, 21:21

... of the embedding factor w ′ = 343 which has embedding index 5, and the two 2’s of u are in po sitions 6 and 7. Note that we obtain ordinary factor order by taking P to be an antichain. Also, we will ... “weakly increasing” and “maximum” have their usual meanings. Also, let w +m be the result of applying the + operator m times. By using the previous lemma a nd induction, we obtain the...

Ngày tải lên: 08/08/2014, 01:20

... Physics, Institute of Physics, Chinese Academy of Sciences, Beijing, 100190, China 3 Engineering Research Center of Solid-State Lighting, School of Electrical Engineering and Automation, Tianjin ... Jia Haiqiang 2 , Wang Wenxin 2 , Chen Hong 2 , and Zhao Liancheng* 1 1 School of Materials Science and Engineering, Harbin Institute of Technology, Harbin, 150001, China 2 National L...

Ngày tải lên: 20/06/2014, 20:20

... band edge with increasing dopant concentration, and corresponding photoluminescence spectra show that Mn doping suppresses both near-band edge UV emission and defect-related blue emission. In ... become light yellow, and the color becomes deeper and deeper with increasing Mn. The phase purity and crystal structure of the pristine ZnO and Mn-doped ZnO for various doping level...

Ngày tải lên: 20/06/2014, 20:20