Báo cáo toán học: "Monochromatic and zero-sum sets of nondecreasing modified diamete" pot

... Dordrecht, 1993. the electronic journal of combinatorics 13 (2006), #R28 17 Monochromatic and zero-sum sets of nondecreasing modified diameter David Grynkiewicz ∗ and Rasheed Sabar †‡ Submitted: Oct ... subset of [1, 3m− 3] of cardinality m + m a − 1 + 1 contains a zero-sum m-set, whence the proof is complete by the arguments at the end of the first paragraph of Case 2...

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

... absorbers hav ing energy band gaps in the range of 1.3 to 1.5 eV compared with CdS and having a wider energy band gap compared with CdS, which trans- mits even higher energy photons and increases the ... National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2010-0024830). Author details 1 School of Materials Science and Engine...

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

... study and participated in its design and coordination. CY participated in the revision of the manuscript. LPS and YW participated in the preparation of the TiO 2 /ZrO 2 bilayer thin film. JQZ and ... full incorporation of the TiO 2 and ZrO 2 film, as shown in TEM. Figure 2 High-resolution cross-sectional TEM images of the interface between the composite thin films and Si.(...

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

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

... Semigroups Yupaporn Kemprasit 1 and Sawian Jaidee 2 1 Department of Mathematics, Faculty of Science Chulalongkorn University, Bangkok 10330, Thailand 2 Department of Mathematics, Faculty of Science , Khon ... V.8.9 of [5] gives an interesting isomorphism theorem as follows: For posets X and Y , OT (X) ∼ = OT (Y ) if and only if X and Y are order- isomorphic or anti- order-is...

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

... Conway–Guy sequence see [B] and [G1]), and d 2 , d  2 , d 3 , and d  3 are the difference vectors for the sequences discovered by Lunnon. No proof of Theorem 2.2 will be given because the proof of Theorem 2.2 ... to the proof of Theorem 2.1 given below. 3 Proof of Theorem 2.1 For ease of notation let d = d n and b = b n .Ifvis an m–dimensional vector then we write v · d for...

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

... graphs u.a.r. and describe the notion of analysing the performance of algorithms on random graphs using systems of differential equations. Details of our algorithm are given in Section 4 and its analysis ... select the first element of C u.a.r. from all of the vertices in the evolving graph and expose all of its incident edges. We say that the remainder of the combined alg...

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

... those of the author(s) and do not necessarily reflect the views of the NSA. the electronic journal of combinatorics 11 (2004), #R4 1 2 The Proofs Let n(G) denote the number of vertices of a graph ... degree of u i to x i and decreases the degree of w i to d G (w i ). Hence the modified graph F is a simple graph with degree list X ∪ Y .  Let B s,n denote the list of length...

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

... G 1 and G 2 in the embedding of G. G 1 is completely embedded in one of the faces of G 2 and vice versa, which is not possible by convexity of faces and by Lemma 15. If G O has a vertex of degree ... value of g are called positive poles and those with the least value of g are negative poles. The sets of positive and negative poles are disjoint since O is non-empty...

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

... vertex z 0 of K 4 is precoloured, each edge incident with z 0 is given a list of three colours not including the colour of z 0 , and every other vertex and edge of K 4 is given a list of five colours, ...  ∆ + 1, and suppose that every vertex and edge of G is given a list of ∆ + 1 colours. Then the vertices and edges of G − (B − z 0 ) can be properly coloured from th...

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