Báo cáo toán học: "Dense Packings of Equal Spheres in a Cube" pps

... in the composite thick films. The calculation of the contents of the Al 2 O 3 in the composite thick films: (a) the Hashin-Shtrikman bounds of contents of Al 2 O 3 in composite thick films ... existence of α-Al 2 O 3 in the composite thick films and to examine the variations in crystallinity according to the changes in the mixing ratio. The cr...

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

... Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. New proofs of Schur-concavity for a class of symmetric ... 0, and then h  (t) ≤ 0, so f (t) is concave on (0, 1). NEW PROOFS OF SCHUR-CONCAVITY FOR A CLASS OF SYMMETRIC FUNCTIONS HUAN-NAN SHI ∗ , JIAN Z...

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

... quasi-periodic word and let any letter in u be covered by a word v. Then we denote u = v ⊗ v ⊗···⊗v. Some Periodicity of Words and Marcus Contextual Grammars 387 However, the other types of Marcus contextual ... set of all hyper primitive words. Remark 1.3. Fig. 1.3 indicates that u is a quasi-periodic word. Fig. 1.3. Vietnam Journal of Mathematics 34:4 (2006) 38...

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

... Dethloff and Tran Van Tan, Uniqueness problem for meromorphic mappings with truncated multiplicities and moving targets, Nagoya Math. J. (to appear). An Extension of Uniqueness Theorems 83 dim  z ... v (f,H) ). Sometimes we write N k) f (r, H )forN k) 1,f (r, H ), N l,f (r, H )forN +∞) l,f (r, H )and N f (r, H )forN +∞) +∞,f (r, H ). An Extension of Uniqueness Theorems...

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

... is Fulkersonian if and only if Δ ∗ is Fulkersonian. We shall see that Fulkersonian hypergraphs can be used to study the integral closures of powers of monomial ideals. Let I be an arbitrary monomial ... multiple of the denominators of l 1 , , l r and the components of b.Then pc = kpl 1 a 1 + ···+ kpl r a r + kpb Vietnam Journal of Mathematics 34:4 (2006) 489–494...

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

... published packings of equal disks in an equilateral triangle have dealt with up to 21 disks. We use a new discrete-event simulation algorithm to produce packings for up to 34 disks. For each n in the ... packings, the distance of the disk center to the boundary of this enclosing triangle is the distance to the line between bonds with the left side of the...

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

... of repeating patterns of dense (and presumably optimal) packings of n equal non-overlapping disks in- side an equilateral triangle (see Fig. 1.1 for and example). It is natural to investigate ... RepeatedPatternsofDensePackings of Equal Disks in a Square R. L. Graham, rlg@research.att.com B. D. Lubachevsky, bdl@research.att.com AT&T Bell Laboratories Murray Hill...

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

... journal of combinatorics (2000),#R46 5 are n ≤ 27, and these proofs involve substantial computation as the value of n increases, and the examination of an exponentially increasing number of cases. Before ... for packing disks in squares. Improving Dense Packings of Equal Disks in a Square David W. Boll Jerry Donovan Ronald L. Graham Boris D. Lubachevsky Hewlett-Pack...

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

... studying combinatorial applications of Hankel matrices and further aspects of orthogonal polynomials was set up by Viennot [76]. Of special interest are determinants of Hankel matrices consisting ... method for solving key equation for decoding Goppa codes”, Information and Control 27, 1975, 87 – 99. [74] U. Tamm, Hankel matrices in coding theory and combinat...

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

... 1. ProofofTheorem3: Let a(G) be the number of automorphisms of an unlabeled n-vertex graph G. The number of distinct labelings of G is n!/a(G). If f (·)isa statistic on graphs, its expectation on labeled ... the proofofTheorem1. 1.9 1.92 1.94 1.96 1.98 2 2.02 2.04 0 0.2 0.4 0.6 0.8 1 t Figure 2: The plot of à (t) for 0 t ≤ 1. 4 Proof of Theorems 2 and 3 Proof of Theorem 2...

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

... journal of combinatorics 10 (2003), #R32 3 The order of monochromatic subgraphs with a given minimum degree Yair Caro ∗ and Raphael Yuster † Department of Mathematics University of Haifa at Oranim Tivon ... types of results. In this paper we consider the property of having a certain minimum degree. ∗ e-mail: yairc@macam98.ac.il † e-mail: raphy@research.haifa.ac....

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

... Subject Classification: 52C17, 05B40. Abstract We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to ... in a unit cube C was raised apparently in 1966 in [S1]. It is shown in that paper that any optimal configuration contains at least one point on every face of C (in fact,...

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

... minimum rank of a graph over a field F was raised at the 2006 American Institute of Mathematics workshop,“Spectra of Families of Matrices described by Graphs, Digraphs, and Sign Patterns,” and in ... Families of Matrices described by Graphs, Digraphs, and Sign Patterns,” and the authors thank AIM and NSF for their support. the electronic journal...

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

... packings of 13 and 46 squares are the trivial ones. The study of packing unit squares into a square goes back to Erd˝os and Graham [2], who showed that large numbers of unit squares can be packed ... two subcases: the electronic journal of combinatorics 17 (2010), #R126 8 Optimal Packings of 13 and 46 Unit Squares in a Square Wolfram Bentz Depa...

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

... matchings are special cases of F -matchings. Let F and G be graphs. An F -matching in G is a subgraph o f G consisting of pairwise vertex disjoint copies of F . We say that the F -matching is ... set of F -matchings not covering v being a separate cla ss C 0 . We argue that the number of F -matchings in each such class is a zero residue...

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