Báo cáo toán học: "On rainbow trees and cycles" ppsx

... analysis of the capacity of N∗Nakagami-m channels. Specifically, we have studied the influence of the severity of fading and the number of hops on the PDF, CDF, LCR, and ADF of the channel capacity. ... the expressions for the statistical properties of the channel capacity C(t). Again, by applying the concept of transformation of random variables...

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

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

... class="bi x0 y0 w5 h 1" alt =""

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

... f u and the first term of f v , by x t the g.c.d. of the first term of f u and the second term of f v , by x r the g.c.d. of the second term of f u and the second term of f v , and by x s the g.c.d. ... decomposition of the presentation ideal of the Symmetric algebra Sym(I) in Theorem 3.1. All these results are independent of the characteristi...

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

... necessary conditions of Hopfian and Co -Hopfian modules. In particular, we show that the weakly Co -Hopfian regular module R R is Hopfian, and the left R-module M is Co -Hopfian if and only if the left R[x]/(x n+1 )- module M[x]/(x n+1 ) ... R[x]/(x n+1 )- module M[x]/(x n+1 ) is Co -Hopfian, where n is a positive integer. 2000 Mathematics Subject Classification: Keywords: Hopfian modul...

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

... B = X = A j . On the structure and classification of SOMAs: generalizations of mutually orthogonal Latin squares Leonard H. Soicher School of Mathematical Sciences Queen Mary and Westfield College Mile ... first study the structure of SOMAs, concentrating on how SO- MAs can decompose. We then report on the use of computational group theory and graph theory in...

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

... standard(C) and the set of standard marked Catalan trees by standard(C, ∗). The standard trees in C 4 are , , , , . One of the standard trees in CH 3 is . The standard tree representing the class [T ... those trees which are largest in their equivalence class as standard trees, and use them as equivalence class representatives. We will de- note the set of standard...

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

... coloured differently. The upper and lower chromatic numbers ¯χ, χ are the maximum and minimum numbers of colours for which there exists a colouring using all the colours. The concepts of mixed hypergraph, upper and ... =3or χ =2. the electronic journal of combinatorics 8 (2001), #R6 7 On the upper and lower chromatic numbers of BSQSs(16) ∗ Giova...

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

... 3 q }. This coloring is easy to show not to have any rainbow arithmetic progressions of length at least 3. It turns out that in order to force a rainbow AP(k) we need to ensure that for each color ... A 5 and i is odd, C otherwise. (4) the electronic journal of combinatorics 11 (2004), #R1 6 On rainbow arithmetic progressions Maria Axenovich Department of Mathematics Iowa State Uni...

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

... with fixed letter frequencies We now consider the letter statistics of ternary square-free words. Denote the number of occurrences of the letter a in a ternary square-free word w n of finite length ... =1isalocalmaximumofP (). Due to the concavity of P (), it is the global maximum. the electronic journal of combinatorics 11 (2004), #R14 15 On the En...

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

... objects of O. The root of the tree is the object of O having the minimum size (possibly the empty object). The objects having the same value of the parameter p lie at the same level, and the sons of ... : the uppermost cell of the rightmost column of the polyomino has the maximal ordinate among all the cells of the polyomino; U2 : the lowest...

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

... On some Ramsey and Tur´an-type numbers for paths and cycles Tomasz Dzido Institute of Mathematics, University of Gda´nsk Wita Stwosza 57, 80-952 Gda´nsk, Poland tdz@math.univ.gda.pl Marek Kubale Algorithms ... is a path of length 3 joining x and y. Now we will show that any path of length at least 3 but shorter than k − 2 which joins x and y can be extended by two addition...

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

... between the LR-tableaux A of shape A and 1s in the top boxes of every column and arbitrary LR-tableaux D of shape D, where D is the skew diagram A with the top boxes of every column removed, simply ... A and B. A skew diagram is connected if it does not decay. A skew character whose skew diagram D decays into disconnected (skew) diagrams A, B is equivalent to the product...

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

... prove it for connected bridgeless graphs by induction on the number of 2-connected components. Let X be the set of vertices of a 2-connected component of G so that X contains only one cut- vertex, ... be singletons (and the rainbow connection number of singletons is 0). The following proposition is an important ingredient in the proof of Theorem 1.1. Proposition 2.2 If G is a 2-connected...

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

... local lemma as in Erd˝os and Spencer [3] and in Albert, Frieze and Reed [1]. We state the lemma as the electronic journal of combinatorics 15 (2008), #R59 7 On rainbow trees and cycles Alan Frieze ∗ Michael ... 4 (a) Let c 0 = 2 −7 and suppose that n ≥ 2 21 . Then every 2c 0 n-bounded edge colouring of K n contains rainbow cycles of length k, n/2 ≤ k ≤ n. (b) If n ≥ e 1000 a...

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