... supported by the < /b> National Natural Science Foundation of < /b> China (11061012), the < /b> project supported by program to Sponsor Teams for < /b> Innovation in < /b> the < /b> Construction of < /b> Talent Highlands in < /b> Guangxi Institutions ... attraction of < /b> the < /b> normal law. Therefore, the < /b> class of < /b> random variables in < /b> Theorems 1.1 is of < /...
Ngày tải lên: 20/06/2014, 21:20
... class="bi x0 y1 w2 h2" alt=""
Ngày tải lên: 05/08/2014, 15:21
Báo cáo toán học: "A Note on the Symmetric Powers of the Standard Representation of Sn" ppt
... have: Proposition 1.2. dim F n = D(n). Proof. Consider the < /b> table of < /b> the < /b> characters χ N ; we are interested in < /b> the < /b> dimension of < /b> the < /b> row-span of < /b> this table. Since the < /b> dimension of < /b> the < /b> row-span of < /b> a matrix ... to the < /b> dimension of < /b> its column-span, we can equally well study the < /b> dimension of...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "A note on the non-colorability threshold of a random graph" pot
... upper bound. In < /b> our approach, a key step to further improving the < /b> upper bound obtained in < /b> [2] is the < /b> exact computation of < /b> the < /b> probability involving the < /b> conjunction of < /b> the < /b> events using the < /b> occupancy ... balls into bins. Using the < /b> sharp estimates obtained by Kamath et al. of < /b> the < /b> probability that no bin i...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "A note on the number of (k, )-sum-free sets" potx
... Denote by SF n k, the < /b> number of < /b> (k, )-sum-free subsets of < /b> [1,n]. Since the < /b> set of < /b> 1 the < /b> electronic journal of < /b> combinatorics 7 (2000), #R30 7 Proof. We need to show that the < /b> left-hand side of < /b> ... thank referees for < /b> many valuable com- ments. Due to their suggestions we were able to prove the < /b> main result of < /b>...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large" ppt
... with b fixed, for < /b> various ranges of < /b> k. For < /b> purposes of < /b> comparison, we repeat these results below. Theorem 1 The < /b> distribution of < /b> the < /b> height of < /b> b- tries < /b> has the < /b> following asymptotic < /b> expan- sions for < /b> ... u − 1=O (b −1/2 ). We thus set u =1+x/ √ b and obtain I = e b b b+ 1 b! B − √ b exp b lo...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: " A Note on the Asymptotics and Computational Complexity of Graph Distinguishability" docx
... mentioned in < /b> [1], is the < /b> problem of < /b> coloring keys on < /b> a (circular) key chain so that one can uniquely identify each key. (In < /b> this case, one is interested in < /b> the < /b> distinguishing number of < /b> the < /b> dihedral ... observation, Theorem 1 above is an easy consequence of < /b> the < /b> following theorem: Theorem 2. If (G)lnd>ln|Aut(G)| the...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "A note on the ranks of set-inclusion matrices" pps
... (0,1)-matrix of < /b> inclusions for < /b> t-subsets versus k-subsets of < /b> X : W T,K =1ifT is contained in < /b> K, and 0 otherwise. These matrices play a significant part in < /b> several combinatorial investigations, see ... −A 0 I AB 0 BBC I −C 0 I = 0 −ABC B 0 implies that, over any field F , r F AB 0 BBC = r F (B) +r F (ABC). (2) The < /b> set-inclusion mat...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: " A Note on the Glauber Dynamics for Sampling Independent Sets" ppt
... ν(x)|. the < /b> electronic journal of < /b> combinatorics 8 (2001), #R8 2 A Note < /b> on < /b> the < /b> Glauber Dynamics for < /b> Sampling Independent Sets Eric Vigoda Division of < /b> Informatics King’s Buildings University of < /b> Edinburgh Edinburgh ... Markov Chain whose stationary dis- tribution is the < /b> desired distribution. The < /b> transitions of < /b> the < /b...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "A note on the number of edges guaranteeing a C4 in Eulerian bipartite digraph" pot
... 1 for < /b> i = |A + | +1, ,m and j = ρn +1, ,2ρn.Denotethisblock M 2 .DenotebyM 3 the < /b> block consisting of < /b> the < /b> rows i = |A + |+1, ,m and the < /b> columns j =1, ,ρn.DenotebyM 4 the < /b> block consisting of < /b> the < /b> ... to [1]. In < /b> this paper we consider the < /b> most basic Tur´an-type problem in < /b> bipartite digraphs, namely, specifying conditio...
Ngày tải lên: 07/08/2014, 06:23