Báo cáo toán học: "Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams" doc

... Stanley and C.H. Yan, Crossings an d nestings of matchings and partitions, Trans. Amer. Math. Soc., 359 (200 7), 1555– 1575. [5] W.Y.C. Chen, J. Qin and C.M. Reidys, Crossings and Nestings of tangled ... ρ k . (3.7) the electronic journal of combinatorics 16 (2009), #R37 6 Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams Willia m Y. C. C hen 1 , J...

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

... n,wheresis the number of members in the covering, and c(H) is some constant depending only on H. The papers of Mills and Mullin [12] and of Brouwer [4], provide an excellent survey of covering designs. ... a i .Sinceπis random, the probability that (a i ,a j )and( a i ,a l ) appear in the same member of D π is exactly h−2 r−2 .Toseethis,fixπ(a i ) and π(a j ), and let Q de...

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

... trapezia T , T  of equal size on either side of P ; see Figure 5. The packing of T consists of columns of width 1 and heights m−jt, with j =0, 1, ,2t−2, so that the number of unit squares being ... the result of Erd˝os and Graham [1], we have n r  r 11/4 as r →∞, and our argument in the proof of Theorem 2 also gives the following result which is valid also for small va...

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

... subgraph G to a set of splits, each of which records which fragment of G should be placed at the root of the solution, what the sub- graphs after removal of this fragment are, and how their solutions ... http://lingo.stanford. edu/sag/papers/copestake.pdf. Markus Egg, Alexander Koller, and Joachim Niehren. 2001. The Constraint Language for Lambda Struc- tures. Logic, Language,...

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

... rate of convergence of Picard and Mann iterations for a class of Zamfirescu operators in arbitrary Banach spaces. Popescu [28] also used this concept to compare the rate of convergence of Picard and ... con- cept of K-mapping for finding a common fixed point of a finite family of nonexpansive mappings and a solution of an equilibrium problem. Applications of K-mappings f...

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

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

... most j +1 ,and (ii) batch 1 of P m must be mapped into batch 1 of P n . We begin with the proof of (i). We may assume without loss that batches i and i +1 of P m correspond to cells of M that ... profile class of q if and only if M p ∈ Prof(M q ). (The wreath products studied in [4], [12], and briefly in the conclusion of this paper provide a different generalization of pr...

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

... Algorithms of this sort find application in many areas: hardware and software testing, combinatorial chemistry and the design of pharmaceutical compounds, coding theory and reliability theory, and computational ... objects of O. The root of the tree is the object of O having the minimum size (possibly the empty object). The objects having the same value of the parameter p l...

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

... of com binatorics 13 (2006), #R74 9 Proof. The proof of 1 follows below. The proof of 2 is similar and is omitted. Let K(R, S) be a biclique of G ˜ ×H with ordered bipartition R ⊆ X G × X H and ... proof that bc ∗ (G ˜ ×H) ≤ bc ∗ (G)bc ∗ (H) is similar to the proof of Theorem 5.1 and is omitted. To show the reverse inequality, let v G and v H be optimal weightings of the e...

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

... y and u and v are adjacent in H, or u = v and x and y are adjacent in G. For bipartite graphs, Yan and Zhang in [18] studied the enumeration of perfect matchings for these Cartesian product of ... finite set of vertices and E(G) is a set of unordered pairs xy of vertices called edges. We say that the edge xy is incident with x, y and that x, y are adjacent and are cal...

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