Báo cáo toán học: "A Scaling Result for Explosive Processes" docx

... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A novel method for crystalline silicon solar cells with low contact resistance and antireflection ... in any medium, provided the original work is properly cited. A novel method for crystalline silicon solar cells with low contact resis...

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

... alt =""

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

...

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

... 1994 Abstract For k ≥ 5, we establish new lower bounds on the Schur numbers S(k) and on the k-color Ramsey numbers of K 3 . For integers m and n ,let[ m, n ]denotetheset{ i | m ≤ i ≤ n }.AsetSof integers ... published bounds for S (5) are 157 ≤ S (5) ≤ 321, the lower bound was proved in [4] and the upper bound in [6]. For Ramsey numbers we know R 2 (3) = 6...

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

... the union of any element of F 1 with any element of F 2 . It is easy to see that the product of two cancellative families is also a cancellative family ( (A 1 ,A 2 ) ∪(B 1 ,B 2 )= (A 1 ,A 2 ) ∪(C 1 ,C 2 ) ... ask how large cancellative families can be. We define f(n) to be the size of the largest possible cancellative family of subsets of a n-set and f(k,n)...

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

... 1996 Abstract A method for constructing cubic graphs with girths in the range 13 to 16 is described. The method is used to construct the smallest known cubic graphs for girths 14, 15 and 16. Introduction We ... JournalofGraphTheory,6, 1982, 1-22. A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16 Geoffrey Exoo Departm...

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

... A Plethysm Formula for p à (x) h (x) William F. Doran IV Department of Mathematics California Institute of Technology Pasadena, CA 91125 doran@ cco.caltech.edu Submitted: ... ) are given in Table 1. So, p (2) (x) ◦ h (2,1) (x)= s (6) (x) − s (5,1) (x)+ 2s (4,2) (x) − 2s (3,3) (x) − s (4,1,1) (x)+ s (2,2,2) (x)+ s (3,1,...

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

... A simple algorithm for constructing Szemer´edi’s Regularity Partition Alan Frieze Department of Mathematical Sciences, Carnegie ... combinatorics 6 (1999), #R17 3 A partition satisfying the second criterion is called equitable. V 0 is called the exceptional class. Following [9], for every equitable partition P into k +1classes ... (ˆx + ) T Wˆy − ≥ ˆγ √ pq/4. (The proof for...

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

... survey of frequency squares. A set of (n − 1) 2 /(m − 1) mutually orthogonal frequency squares (MOFS) of type F (n; λ)isacomplete set of type F (n; λ). We shall describe a construction for complete ... 2000. Abstract A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complet...

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

... v(G) denote the number of vertices, and (G) denote the number of edges. In this paper, we construct a graph G having no two cycles with the same length which leads to the following result. Theorem. ... Chunhui Lai, On the size of graphs with all cycle having distinct length, Discrete Math. 122(1993) 363-364. [6] Chunhui Lai, The edges in a graph...

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

... extended to T(m,n) for all m. It is worth remarking that the reciprocity theorem satisfied by the Laurent polynomials M( (m,n)) is a bit more complicated than the reciprocity theorem satisfied by ... is worth mentioning here that Cohn has proved a different reciprocity theorem for domino tilings [1]; it is unclear to me whether his Theorem 1 is related to the result treated...

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

... journal of combinatorics 9 (2002), #R18 9 A ‘nice’ bijection for a content formula for skew semistandard Young tableaux Martin Rubey Institut făur Mathematik Universităat Wien http://www.univie.ac.at/~rubey a9 104910@unet.univie.ac.at Submitted: ... semistandard Young tableau of shape /à,shortSSYT,isatabloidP such that the entries are weakly increasing along rows...

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

... random sparse oriented graphs and its relation to a conjecture of Woodall Jair Donadelli ∗ Departamento de Inform´atica Universidade Federal do Paran a Centro Polit´ecnico, 81531–990, Curitiba PR, ... mean a transversal of the family of oriented cycles of  G. A dual version of Woodall’s conjecture may be stated as follows: for any planar oriented gr...

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

... Hence F 1 = +∞  j=x T j , the electronic journal of combinatorics 11 (2004), #R31 7 A Scaling Result for Explosive Processes M. Mitzenmacher ∗ Division of Engineering and Applied Sciences Harvard ... with n balls obtains the next ball is proportional to f(n) for some function f. For example, a common case to study is when f(n)=n p for some constant p>1. Specifically, we cons...

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

... k-traceable oriented graph of order n that is nontraceable? We formulate the following conjecture. Conjecture 1 (The Traceability Conjecture (TC)) For every integer k ≥ 2, every k-traceable oriented ... of this conjecture would imply the truth of an important special case of the Path Partition Conjecture for Oriented Graphs. In this paper we show the conjecture is true...

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