Báo cáo toán học: "A Gagliardo-Nirenberg Inequality for Lorentz Spaces" pps

Báo cáo toán học: " A novel method for crystalline silicon solar cells with low contact resistance and antireflection coating by an oxidized Mg layer" ppt

Báo cáo toán học: " A novel method for crystalline silicon solar cells with low contact resistance and antireflection coating by an oxidized Mg layer" ppt

... and distributed freely for any purposes (see copyright notice below). Articles in Nanoscale Research Letters are listed in PubMed and archived at PubMed Central. For information about publishing ... screen printed Ag metal paste forms too high potential barrier to form an ohmic contact with an n+ region, a new material can be inserted between Ag and Si to form low barrier height (Φ B )...

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

14 648 0
Báo cáo toán học: "A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers of K3" doc

Báo cáo toán học: "A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers of K3" doc

... REFERENCES 3 For appropriate positive constants c 1 and c 2 , f (P ) is the objective function for our maximization problem. In practice, we make c 1 relatively ... 1994; Accepted: September 18, 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 }.AsetS...

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

3 373 0
Báo cáo toán học: " A NEW CONSTRUCTION FOR CANCELLATIVE FAMILIES OF SETS" doc

Báo cáo toán học: " A NEW CONSTRUCTION FOR CANCELLATIVE FAMILIES OF SETS" doc

... than (1) for m ≥ 8. So the Bollobas conjecture fails for k ≥ 10. The idea of the above construction which improves on products of H 3 can be applied to products of other families as well. For example, ... H k for any k>3 as well. Or we can start with the families F constructed above. This will allow a very slight improvement in the lower bound found for α above. The best upper bo...

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

3 327 0
Báo cáo toán học: "A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16" pptx

Báo cáo toán học: "A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16" pptx

... smallest such graph known [2]. A Cubic Graph of Girth 16 For girth 16 we take n = 140 and use the complete binary tree with radius two. For even i we label T i so that its edges are: (v i,0 ,v i,6 ), ... 26, 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,...

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

3 374 0
Báo cáo toán học: "A Plethysm Formula for pµ (x) ◦ hλ (x) William F. Doran IV Department of Mathematics California Institute of Technology Pasadena, CA 91125" doc

Báo cáo toán học: "A Plethysm Formula for pµ (x) ◦ hλ (x) William F. Doran IV Department of Mathematics California Institute of Technology Pasadena, CA 91125" doc

... 1997 Abstract This paper gives a new formula for the plethysm of power-sum symmetric functions and complete symmet- ric functions. The form of the main result is that for µ  b and λ  a with length ... 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: ... well-defi...

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

10 397 0
Báo cáo toán học: "A simple algorithm for constructing Szemer´di’s Regularity Partition e" pps

Báo cáo toán học: "A simple algorithm for constructing Szemer´di’s Regularity Partition e" pps

... (ˆx + ) T Wˆy − ≥ ˆγ √ pq/4. (The proof for the other cases is similar.) We define random subsets S, T as follows: For each i ∈ R, put i in S with probability ˆx + i √ p/β. For each j ∈ C,putj in T with ... obtained from W by replacing elements in rows other than I by zero. Then (using the standard inequality that for any vector a and matrix M,wehave|a T M|≤|a|||M|| F ,where||M|| 2 F...

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

7 340 0
Báo cáo toán học: "A construction method for complete sets of mutually orthogonal frequency squares" pdf

Báo cáo toán học: "A construction method for complete sets of mutually orthogonal frequency squares" pdf

... A construction method for complete sets of mutually orthogonal frequency squares VCMavron Department of Mathematics, University ... 3BZ U.K. vcm@aber.ac.uk Submitted: May 17, 2000; Accepted: August 22, 2000. Abstract A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce ... squares (MOFS) of type F (n; λ)isacomplete s...

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

3 335 0
Báo cáo toán học: "A LOWER BOUND FOR THE NUMBER OF EDGES IN A GRAPH CONTAINING NO TWO CYCLES OF THE SAME LENGTH" pptx

Báo cáo toán học: "A LOWER BOUND FOR THE NUMBER OF EDGES IN A GRAPH CONTAINING NO TWO CYCLES OF THE SAME LENGTH" pptx

... Acknowledgment The author thanks Prof. Yair Caro and Raphael Yuster for sending reference [7]. The author also thanks Prof. Cheng Zhao for his advice. References [1] J.A. Bondy and U.S.R. Murty, Graph ... Science Edlition) 8(4)(1994), 30-34. [7] E. Boros, Y. Caro, Z. F¨uredi and R. Yuster, Covering non-uniform hypergraphs (submitted, 2000). the electronic journal of combinatorics 8 (2001)...

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

6 478 0
w