Báo cáo toán học: " Order-distributions and the Laplace-domain logarithmic operator" docx

Báo cáo toán học: " Dilemmas in the reliable estimation of the in-vitro cell viability in magnetic nanoparticle engineering: which tests and what protocols?" doc

Báo cáo toán học: " Dilemmas in the reliable estimation of the in-vitro cell viability in magnetic nanoparticle engineering: which tests and what protocols?" doc

... 95% confidence interval. Dilemmas in the reliable estimation of the in- vitro cell viability in magnetic nanoparticle engineering: which tests and what protocols? Clare Hoskins 1 , Lijun Wang* 1 , ... number of factors including an increase in the coating diameter upon addition of the PEG moiety [33], thus increasing the stability of the...

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

22 477 0
Báo cáo toán học: " Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type" pdf

Báo cáo toán học: " Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type" pdf

... 1994. Abstract New short and easy computer proofs of finite versions of the Rogers-Ramanujan identities and of similar type are given. These include a very short proof of the first Rogers-Ramanujan identity ... Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type Peter Paule ∗ Research I...

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

9 343 2
Báo cáo toán học: "Asymptotics for the Probability of Connectedness and the Distribution of Number of Components Jason P. Bell Department of Mathem" doc

Báo cáo toán học: "Asymptotics for the Probability of Connectedness and the Distribution of Number of Components Jason P. Bell Department of Mathem" doc

... of Connectedness and the Distribution of Number of Components Jason P. Bell Department of Mathematics University of California, San Diego La Jolla, CA 92903-0112, USA (email: jbell@math.ucsd.edu) Edward ... depends on the type of map, and A depends on both the type of map and the surface. See [22] for a proof of (7) for the unrooted case an...

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

22 344 0
Báo cáo toán học: "Meet and Join within the Lattice of Set Partitions" doc

Báo cáo toán học: "Meet and Join within the Lattice of Set Partitions" doc

... replacement of n by n − 1andofr by r − r/(1 + r)n +O(n −2 ), is the formula stated as Theorem 3. the electronic journal of combinatorics 8 (2001), #R15 6 Meet and Join within the Lattice of Set Partitions E. ... ,x it ). The various x ij are themselves partitions of a set S i ⊆ [n]; the join (over j)ofthex ij equals {S i } ;and = {S i :1≤ i ≤ } is a partition...

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

8 365 0
Báo cáo toán học: "omputation of the vertex Folkman numbers F (2, 2, 2, 4; 6) and F (2, 3, 4; 6)" pdf

Báo cáo toán học: "omputation of the vertex Folkman numbers F (2, 2, 2, 4; 6) and F (2, 3, 4; 6)" pdf

... ,a r )-free coloring of V (G), a contradiction. 3 Proof of Theorem D. According to the lemma, it follows from G → (2, 3, 4) that G → (2, 2, 2, 4). Therefore F (2, 2, 2, 4; 6) ≤ F( 2, 3, 4; 6) and ... [15]); F (3, 4; 5) = 13 [10]; F (2, 2, 4; 5) = 13 [11]; F (4, 4; 6) = 14 [14]. In this note we determine two additional numbers of...

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

7 380 0
Báo cáo toán học: "Graphic and Protographic Lists of Integers" docx

Báo cáo toán học: "Graphic and Protographic Lists of Integers" docx

... positive graphic lists are the 0 -protographic lists, and the protographic lists are the 1 -protographic lists. As might be expected, every s -protographic list is also (s + 1) -protographic. This follows ... lists Y such that the merger X ∪ Y is not graphic, where the merger of two lists is obtained by summing the multiplicities of their elements. More generally, define...

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

6 272 0
Báo cáo toán học: "Fans and Bundles in the Graph of Pairwise Sums and Product" potx

Báo cáo toán học: "Fans and Bundles in the Graph of Pairwise Sums and Product" potx

... large integers . Theorem 3.1. The graph G × + contains  -bundles for arbitrarily large integers .Inpar- ticular, for any positive integer , the graph G × + contains subgraphs of the following ... 16 :(16, 48) →¬y ; the electronic journal of combinatorics 11 (2004), #R6 10 Fans and Bundles in the Graph of Pairwise Sums and Products Lorenz Halbeisen Depart...

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

11 367 0
Báo cáo toán học: "Asymptotics for the distributions of subtableaux in Young and up-down tableaux" pps

Báo cáo toán học: "Asymptotics for the distributions of subtableaux in Young and up-down tableaux" pps

... the proof of Lemma 2 in our proof of Theorem 1, we will include the full proof of Lemma 2 there. As examples of these lemmas, for the symmetric group, which has m = n(n − 1)/2 roots, the asymptotic ... covariance form of X.LetY N be the sum of N independent copies of X. For any vector v,letp(v) be the probability for the random walk, and let q(v) the...

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

22 378 0
Báo cáo toán học: "Triangulations and the Haj´s Conjecture " ppt

Báo cáo toán học: "Triangulations and the Haj´s Conjecture " ppt

... can go wrong. On the other hand, he observed that locally planar graphs and triangulations of the projective plane and the torus satisfy Haj´os Conjecture, and he conjectured that the same holds ... satisfy the Haj´os Conjecture? For a graph H and a positive integer t,let ˜ H t be the graph obtained from the union of H and the clique K t by adding all edges betwee...

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

7 415 0
Báo cáo toán học: "Bounds for the average Lp-extreme and the L∞-extreme discrepancy" pptx

Báo cáo toán học: "Bounds for the average Lp-extreme and the L∞-extreme discrepancy" pptx

... 5 Remark 4. The probabilistic argument we used for deriving our upper bound for the average L p -extreme discrepancy was sketched in [11]. Unfortunately the derivation there contains an error (the number ... similar way we can use the bound for the average L p -star discrepancy to calculate an upper bound for the inverse n ∗ ∞ (d, ε) of the star discrepancy: With (2...

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

11 208 0
Báo cáo toán học: "Regularisation and the Mullineux map" pot

Báo cáo toán học: "Regularisation and the Mullineux map" pot

... v-decomposition numbers; one con- cerning the Mullineux map, and the other concerning e-regularisation. The first of these involves the e-weight of a partition, defined in §1.3. the electronic journal of combinatorics ... v-decomposition numbers are the coefficients obtained when the elements of the canonical basis are expanded in terms of the standard basis, i.e. the coeffi...

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

15 173 0
Báo cáo toán học: "Shellability and the strong gcd-condition" doc

Báo cáo toán học: "Shellability and the strong gcd-condition" doc

... 4.2.5]. There are several equivalent but differently flavored characterizations of Golod rings, see Sections 5.2 and 10.3 in [1] and the references therein. One is that R is Golod if the ranks of the ... order of the facets of ∆ ∨ . The complements F 1 c , . . . , F r c are the minimal non-faces of the flag complex ∆, so |F i c | = 2 and |F i | = |V |−2 for all i. Let j ≥ 2...

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

7 220 0
Báo cáo toán học: "Equidimensionality of the Brauer loop scheme" docx

Báo cáo toán học: "Equidimensionality of the Brauer loop scheme" docx

... polynomial to the entries of the Frobenius-Perron eigenvector of a certain Markov process associated to the Brauer loop model. The main theorem of this paper is a proof of the following conjecture of Knutson ... generalization of a theorem of Knutson and Zinn-Justin [1]. (Because the proofs of the theorems are identical, we refer the reader to their paper f...

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

11 305 0
w