Báo cáo toán học: "Self-dual Planar Hypergraphs and Exact Bond Percolation Thresholds" doc
... hypergraph s, leading to definitions of planar hypergraphs and self-dual planar hypergraphs. T here exist infinitely many self-dual planar 3-uniform hypergraphs, and, as a consequence, there exist ... Self-dual Planar Hypergraphs and Exact Bond Percolation Thresholds John C. Wierman ∗ Department of Applied Mathematics and Statistics Johns Hopkins University wierman@jh...
Ngày tải lên: 08/08/2014, 14:22
... functions. SIAM Journal on Algebraic and Discrete Methods 3, 2 (1990), 216–240. [12] Flajolet, P., and Sedgewick, R. Mellin transforms and asymptotics: finite differences and Rice’s integrals. Theoretical ... P., and Vepstas, L. On differences of zeta values. Journal of Com- putational and Applied Mathematics 220, 1–2 (2008), 58–73. [15] Ford, W. B. Studies on divergent series and...
Ngày tải lên: 08/08/2014, 11:20
... vertices and edges defined in the usual way for graphs. For a thorough study of clutters and hypergraphs from the point of view of combina torial optimization and commutative algebra see [6, 25] and ... set X is called the v ertex set of C and E is called the edge set of C, they are denoted by V (C) and E(C) respectively. Clutters are special hypergraphs and are sometimes cal...
Ngày tải lên: 08/08/2014, 12:22
Báo cáo toán học: "Convex-Ear Decompositions and the Flag h-Vector" docx
... ement, input, and patience of Ed Swartz. Thanks also to the anonymous referee for numerous helpful suggestions. References [1] Anders Bj¨orner. The homolo gy and shellability of matroids and geometric ... i, and note that a chain e is in ∂Σ i if and only if there exist two maximal chains e old and e new , each containing e as a subchain, such that e old is a chain in X ∪ ( i−1 j...
Ngày tải lên: 08/08/2014, 12:23
Báo cáo toán học: "Colouring planar mixed hypergraphs" potx
... of hypergraphs, mixed hypergraphs, planar graphs and hypergraphs, colourability, chromatic spectrum. 2000 Mathematics Subject Classification: 05C15. 1 Introduction We use the standard graph and ... Radhika Ramamurthi, and Kathie Cameron for useful suggestions and fruitful discussions. References [1] C. Berge, Graphs and Hypergraphs, North Holland, 1973. [2] C. Berge, Hypergrap...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "On Planar Mixed Hypergraphs" pps
... its edges is exactly k.Mixed hypergraphs were introduced in [22], planar hypergraphs were introduced in [24] and the concept of planar mixed hypergraphs was first studied in [15] and further investigated in ... Colorings of Planar Mixed Hypergraphs We first prove the promised generalization for planar mixed hypergraphs of the two- colorability theorem for planar hypergr...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "Biased Positional Games and Small Hypergraphs with Large Covers" pptx
... systematically rounding and divisibilty issues. 2 The random graph intuition and open problems In this section we discuss a paradigm, pointed out first by Chv´atal and Erd˝os [8] and covered later in ... instead each of them would play completely at random, RandomMaker’s graph would look like a random graph with n vertices and m edges. This model of random graphs is usually denoted b...
Ngày tải lên: 07/08/2014, 21:20
Báo cáo toán học: " On the first- and second-order statistics of the capacity " ppt
... N increases, the approximated LCR fits quite closely to the exact results. Specifically for N ≥ 4, a very good fitting between the exact and the approximation results is observed. The ADF T C (r) of ... MATHEMATICA. The PDF p C (r) and the CDF F C (r) of the capacity C(t) of N∗Nakagami-m channels are presented in Figures 2 and 3, respectively. Also, the approximation results obtained i...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " Strong convergence theorems and rate of convergence of multi-step iterative methods for continuous mappings on an arbitrary interval" pptx
... useful and crucial for our following results. Lemma 3.2 Let E be a closed interval on the real line and T : E → E be a con- tinuous and nondecreasing mapping such that F(T ) is nonempty and bounded ... u 1 > u 1 and Tx 1 > x 1 . By using (1.9), (1.11) and the same argument as in Case 1, we can show that x n ≥ u n for all n ≥ 1. We note that x 1 < L and by using (1.11)...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " Integrated acoustic echo and background noise suppression technique based on soft decision" docx
... suppress the acoustic echo and the noise signal with a single gain based on soft decision. For this, the noise and echo spectral are separately and efficiently estimated and combined by a single ... between the microphone input and the estimate echo, and (2) the cross-correlation coefficient between microphone input and the residual error of the suppressor are computed and used to...
Ngày tải lên: 20/06/2014, 20:20