Báo cáo toán học: " a construction for sets of integers with distinct subset sums" potx
... smooth. a construction for sets of integers with distinct subset sums Tom Bohman Department of Mathematics, 2-339 Massachusetts Institute of Technology 77 Massachusetts Ave. Cambridge, MA 02139 bohman@math.mit.edu Submitted: ... we can make an approximation of L ≈ .22001865 with an error of less than 1.5 ·10 −7 . Inequality (10) can certainly be used to obtain more...
Ngày tải lên: 07/08/2014, 06:22
... set of MOFS and an a ne design. A special case is Laywine’s construction [2] (see also IV.20.8(3) in [1]), which uses a complete set of MOLS in place of the MOFS and the a ne design has the parameters ... exists a Hadamard matrix of order 4t. Note that Corollary 5 asserts the existence of a type F (2kλ; kλ) complete set without requiring the existence of a Hadamard m...
Ngày tải lên: 07/08/2014, 06:20
... exists u ∈ A such that (u, v) ∈ E. Note that in a tournament it is always the case that A → B or B → A. If A = {a} and A → B we write a → B, and vice versa. For a linear order L on a set of vertices, ... such as C in definition 2, and denote by ∆ B the union of all sets such as D. Note that in certain cases, such as a list where all vertices of A beat all vertice...
Ngày tải lên: 08/08/2014, 14:23
Báo cáo toán học: " A Stochastic EOQ Policy of Cold-Drink-For a Retailer" ppsx
... EOQ Policy of Cold-Drink -For a Retailer Shib Sankar Sana 1 and Kripasindhu Chaudhuri 2 1 Departme nt of Math., Bhangar Mahavidyalaya University of Calcutta Viil. +P.O.+ P. S Bhangar, Dist 24PGS(South) ... quantity)model both for discrete and continuous distribution of demands of cold-drink. A general characterization of the optimal inventory policy is developed analyticall...
Ngày tải lên: 06/08/2014, 05:20
Báo cáo toán học: " A Recurrence for Counting Graphical Partitions" ppsx
... becomes impractical because of the huge space requirements. An additional burden on space is that |G(n)| gets large quickly so that some method must be used to manipulate and allocate enough storage for ... 10 References [At] A. O. L. Atkin, A note on ranks and conjugacy of partitions,” Quart. J. Math., Oxford Ser. (2)17 (1966) 335-338. [EG] P. Erd¨os and T. Gallai, “Graphs with giv...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx
... con- centrating especially on antimatroids. Several familiar expansions for β(G) have greedoid analogs. We give combinatorial interpretations for β(G )for simplicial shelling antimatroids associated with ... that every subset of an independent set is independent in a matroid, but a feasible set in a greedoid will have non-feasible subsets in general. As with matroids, the r...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion Edward A" ppsx
... function [16]. We are not aware of any multivariate singu- larity analysis that combines algebraic singularities and Hayman-admissibility. We discussed multivariate Hayman admissibility in [8]. We ... Mathematics University of California, San Diego La Jolla, CA 92093-0112, USA ebender@ucsd.edu L. Bruce Richmond Department of Combinatorics and Optimization University of Waterloo Waterl...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: " A criterion for unimodality" docx
... Math., to appear. [2] BRENTI, F.: Log-concave and unimodal sequences in Algebra, Combinatorics and Geometry: an update. Contemporary Mathematics, 178, 71-84, 1994. [3] STANLEY, R.: Log-concave and ... so P (x+1) is a sum of unimodal polynomials with the same mode, and hence unimodal. We now restate Theorem 2.1 and offer an alternative proof. Theorem 2.2. Let b k > 0 be a nondecreasi...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "A unified view of determinantal expansions for Jack Polynomials" pptx
... use of the Laplace Beltrami operator. Annals of Mathematical Statistics, 39:1711–1718, 1968. [3] L Lapointe, A Lascoux, and J Morse. Determinantal expression and recursion for jack polynomials. ... conventional total 1 Thanks are due to Peter Forrester for commenting on an early draft, and an anonymous referee who simplified the structure of the paper and suggested improved proofs...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "A Bound for Size Ramsey Numbers of Multi-partite Graphs" pot
... edges of a graph is often called the size of the graph, Erd˝os, Faudree, Rousseau and Schelp [2] introduced an idea of measuring minimality with respect to size rather than order of the graphs G with ... (2007), #N11 3 A Bound for Size Ramsey Numbers of Multi-partite Graphs Yuqin Sun and Yusheng Li ∗ Department of Mathematics, Tongji University Shanghai 200092, P. R. Chi...
Ngày tải lên: 07/08/2014, 13:21