Báo cáo toán học: "Lower Bounds for the Size of Random Maximal H-Free Graphs" pdf

báo cáo hóa học:"Phylogenetic evidence for the distinction of Saaremaa and Dobrava hantaviruses" pdf

... participated in the analysis of the results and drafted the manuscript. AV participated in the analysis of the results and helped to draft the manu-script. AP designed the study, participated in the analysis of ... AccessResearchPhylogenetic evidence for the distinction of Saaremaa and Dobrava hantavirusesTarja Sironen, Antti Vaheri and Alexander Plyusnin*Address: Department of Virology, Haartman Institute, ... set [22,23]. The test for molecular clock and esti-mation of the time of split of these two viruses was donewith TreePuzzle [21].Competing interests The author(s) declare that they have no...

Báo cáo toán học: " Sharp bounds for Seiffert mean in terms of root mean square" pot

... thatf(t) is strictly increasing in [1, +∞).9 Sharp bounds for Seiﬀert mean in terms of root mean squareYu-Ming Chu∗1, Shou-Wei Hou2and Zhong-Hua Shen21∗Department of Mathematics, Huzhou ... below). For information about publishing your research in Journal of Inequalities and Applications go tohttp://www.journalofinequalitiesandapplications.com/authors/instructions/ For information ... Seiﬀert means in terms of Lehmer means. J. Math. Inequal. 4(4), 581–586 (2010)[7] Chu, Y-M, Zong, C, Wang, G-D: Optimal convex combination bounds of Seiﬀert and geometric means for the arithmetic mean. ...

Báo cáo toán học: " Some results for the q-Bernoulli, q-Euler numbers and polynomials" doc

... q-Bernoulli, q-Euler numbers, and polynomials.2. q-Bernoulli, q-Euler numbers and polynomials related to the Bosonic and the Fermionic p-adic integral on ℤpIn this section, we provide some basic formulas ... functions of the q-Bernoulli, q-Eule r numbers, and polynomials. We shall provide some basic formulas for the q-Bernoulli and q-Euler polynomials which will be used to prove the main results of ... information isavailable at the end of the articleAbstract The q-analogues of many well known formulas are derived by using sev eral results of q-Bernoulli, q-Euler numbers and polynomials. The...

Báo cáo toán học: "Spectral asymptotics for the "soft" selfadjoint extension of a symmetric elliptic differential operator " ppt

... class="bi x0 y1 w1 h 3" alt ="" ...

Báo cáo toán học: "Threshold Functions for the Bipartite Tur´n Property a" potx

... =0|z=n2p)≤P(X=0|z≤n2p)≤3P(X=0)→0by the theorem, where the last inequality above follows due to the observation thatP(A|B) ≤ P(A)/P(B) and the fact that the central limit theorem [or the approxi-mate and ... if the exact form of (7) is used for , then = o(1)i à2/ i t = o(n1/5), so that even the extended Janson inequality will not lead toan improvement in the results of [9]. We need, therefore, ... = o(n1/3); in the last two lines of the above calculation, the notation f  g means thatf ≥ Kg for some positive constant K. This proves the theorem; as in [9], the use of the second moment...

Báo cáo toán học: "New Bounds for Codes Identifying Vertices in Graphs" pdf

... appear.[2]G.D.Cohen,I.Honkala,S.LitsynandA.Lobstein:Covering Codes, Elsevier,1997.[3] M.G.Karpovsky,K.ChakrabartyandL.B.Levitin: Onanewclassofcodes for identifying vertices in graphs, IEEE Trans. Inform. Th., vol. 44, ... vertex of degreezero.Since, by symmetry, one element in C2produces two vertices with degree zero or New Bounds for Codes Identifying Vertices in GraphsG´erard Cohencohen@inf.enst.frIiro Honkalahonkala@utu.fiAntoine ... Butthis identifying code is not optimal. Codewords can be deleted without losing the identifying property. We obtain the code of ﬁgure 9. Hence :Theorem 3.1The minimum density of an identifying...

Báo cáo toán học: "Improved bounds for the number of forests and acyclic orientations in the square lattice" doc

... several counting problems on the square lattice Ln. There the authors gave the following bounds for the asymp-totics of f(n), the number of forests of Ln ,and (n), the number of acyclic orienta-tions ... y>0andzty =1. the electronic journal of combinatorics 10 (2003), #R4 15 Improved bounds for the number of forests and acyclic orientations in the square latticeN. CalkinDepartment of Mathematical ... (2.2) The Tutte polynomial contains much information on the graph G; we refer to [7] and the survey paper [3] for background information. In particular:ã T(G;2, 1) is the number f(G) of spanning forests...

Báo cáo toán học: "Improved bounds on the length of maximal abelian square-free word" pot

... particular,it contains exactly one occurrence of the greatest letter it contains, since between two the electronic journal of combinatorics 11 (2004), #R17 3 Improved bounds on the length of maximal abelian square-free ... m. Further, if there is a pair of (k − 1)’s in wm, one must be on the left half of smand hence before the m in hm+1,and the other must be on the right half of sk−1and hence after the k ... an abelian square-free word by deletingevery occurrence of some letter need not be abelian square-free. ) This observation on the deletion of letters provides the basic argument in our proof of...

Báo cáo toán học: "Lower Bound for the Size of Maximal Nontraceable Graphs." pot

... in the next section, to prove that a MNT graph of order n ≥ 10 has at least3n−22edges. The ﬁrst one concerns the lower bound for the number of edges of MNH graphs. It is the combination of ... is not complete, then someinternal vertex of Q has a neighbour in G − V (Q). the electronic journal of combinatorics 12 (2005), #R32 2 Lower Bound for the Size of Maximal Nontraceable Graphs∗Marietjie ... k<nandthen, clearly, e(G) >3n−22 for n ≥ 8. Thus we assume that G is connected.We need to prove that the sum of the degrees of the vertices of G is at least 3n − 2.In view of Theorem...

Báo cáo toán học: "Lower bounds for the football pool problem for 7 and 8 matches" pdf

... with n = 7 and s = 27 and get8k5+ 15k6+ 22k 7 + 29i 8 ki≤ 58. (8) Multiplication with 3/22 and rounding oﬀ yields Lemma 3. the electronic journal of combinatorics 14 (20 07) , #R 27 4 5 ... we show k3 (7) ≥ 156 and k3 (8) ≥ 402 improvingon the best previously known bounds k3 (7) ≥ 153 and k3 (8) ≥ 3 98. The proofsare founded on a recent technique of the author for dealing with ... n = 7 and n = 8 (with k = 4 resp. k = 5). In the case n = 7 the bestpreviously known lower bound k3 (7) ≥ 153 is due to Habsieger [5]. We showTheorem 1. k3 (7) ≥ 156. For the case of 8 matches...

Báo cáo toán học: "Lower Bounds for the Size of Random Maximal H-Free Graphs" pdf

... keyingredient of our proof.Given the informal discussion above, the proof of Theorem 1.1 looks very roughly asfollows. At the ﬁrst part of the proof we consider the graph G(n, ρ) for a relatively ... claim holds for d − 1. We prove the claim for d. Let S = (G1, G2, . . . , Gd)be the sequence of the labels of the nodes ui, i ∈ [d], along the path P . Assume for the sake of contradiction ... to the evolving graph), Bohman expresses the expected change in the values of the random variables in the collection, using the same set of random variables. This allows one toexpress the random...

Báo cáo toán hoc:"Generating functions for the number of permutations with limited displacement." ppsx

... be the permutation corresponding to the transposed of B.We start with A0,0. Let Ax,zbe the matrix we have after k − 1 steps. Let the ﬁrstrow of Ax,zbe row number r and the ﬁrst column of ... ﬁrst column of Ax,zbe column number s of the original A0,0. Let the number of erased columns j such that j < prbe tkand the number the electronic journal of combinatorics 16 (2009), #R104 ... A0.Moreover, we note that at the start of the i’th step, |{j < i | pj< pi}| columns to the left of the column piin the original A0have already been removed. Therefore, at the i’thstep, when...

Báo cáo toán học: "Lower Bounds for q-ary Codes with Large Covering Radius" ppsx

... (i) and (iv) P3∩ P4= {x} with x ∈ Z6. Let R denote a setthe electronic journal of combinatorics 16 (2009), #R133 5 Lower Bounds for q-ary Codes with Large Covering RadiusWolfga ng HaasImmanuel ... the case k = 5. For k > 5 thecomputational eﬀort became too la r ge for a systematical treatment. Here we got only afew sporadic new bounds: six bounds for k = 6, two bounds for k = 7 and ... Chen, I. S. Honkala, Lower bounds for q - ary cove ring codes, IEEE Trans.Inform. Theory 36 (1990), 664-671.[2] G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes, North Holland, Ams-terdam,...

Báo cáo toán học: "Lower bounds for identifying codes in some inﬁnite grids" potx

... electronic journal of combinatorics 17 (2010), #R122 6 References[1] Ir`ene Charon, Iiro Honkala, Olivier Hudry, and Antoine Lobstein. General bounds for identifying codes in some in nite regular graphs. ... of density in certain in nite graphs which are locally ﬁnite.We present new lower bounds for densities of codes for some sm all values of r in both the square and hexagonal grids.1 Introduct ... verticescan witness a pair.the electronic journal of combinatorics 17 (2010), #R122 7 Lower bounds for identifying codes in some in nite gridsRyan Martin∗Brendon StantonDepartment of MathematicsIowa...

Báo cáo toán học: "Lower Bounds for the Average Genus of a CF-graph" doc

... such a polygon do not change genus of such a surface.Operation 1: Aaa−∼ A, Operation 2: AabBab ∼ AcBc,Operation 3: AB ∼ {(Aa), (a −B)}, A A a a A B a bb a A Bcc A B A Bc cFigure 4: Operation ... attaching ears serially or by bar -amalgamation of a cactus to GN The authors of [5] discussed a Kuratowski type theorem for average genus of graphs.They obtained the struct ure of average genus ... to a subgraph of Gi+1 for all i  1. In [4] it was proved that the values of the average genus for 2-connected graphs have limit points. Note that the averag e genus for bar-amalgamation of a...

Xem thêm

Từ khóa: Nghiên cứu tổ chức pha chế, đánh giá chất lượng thuốc tiêm truyền trong điều kiện dã ngoại Nghiên cứu vật liệu biến hóa (metamaterials) hấp thụ sóng điện tử ở vùng tần số THz Giáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôit Phát triển mạng lưới kinh doanh nước sạch tại công ty TNHH một thành viên kinh doanh nước sạch quảng ninh Nghiên cứu về mô hình thống kê học sâu và ứng dụng trong nhận dạng chữ viết tay hạn chế Tìm hiểu công cụ đánh giá hệ thống đảm bảo an toàn hệ thống thông tin Thơ nôm tứ tuyệt trào phúng hồ xuân hương Thiết kế và chế tạo mô hình biến tần (inverter) cho máy điều hòa không khí Tăng trưởng tín dụng hộ sản xuất nông nghiệp tại Ngân hàng Nông nghiệp và Phát triển nông thôn Việt Nam chi nhánh tỉnh Bắc Giang (Luận văn thạc sĩ)Giáo án Sinh học 11 bài 15: Tiêu hóa ở động vật chuong 1 tong quan quan tri rui ro Nguyên tắc phân hóa trách nhiệm hình sự đối với người dưới 18 tuổi phạm tội trong pháp luật hình sự Việt Nam (Luận văn thạc sĩ)Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vật Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vật Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vật Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vật BÀI HOÀN CHỈNH TỔNG QUAN VỀ MẠNG XÃ HỘI HIỆU QUẢ CỦA MÔ HÌNH XỬ LÝ BÙN HOẠT TÍNH BẰNG KIỀM TÁI CHẾ NHỰA VÀ QUẢN LÝ CHẤT THẢI Ở HOA KỲ QUẢN LÝ VÀ TÁI CHẾ NHỰA Ở HOA KỲ