Báo cáo toán học: "The MacNeille Completion of the Poset of Partial Injective Functions" ppsx

... a k, l is the tap weight of the kth component in the lth cluster. The delay of the lth cluster is denoted by T l and τ k, l is the delay of the kth multipath component relative to T l .Thephase j k, ... Figure 1, and the choice of the pulse pair depends on the bandwidth requirement of the system and its allocated frequency range. Increasing the value of a d...

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

... general case. Utilizing the technique of the modulus of convexity and a new demiclosed principle for nonself-maps of Kazor [24], we establish the we ak con- vergence theorem of the three-step iterative ... most of these articles, the operator T remains a self-mapping of a nonempty closed convex subset C of a uniformly convex Banach space X. If, however, the domain o...

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

... more edges, then clearly G can be dominated by v together with a vertex of degree 2 taken from A. So we may assume that A has at most one edge. The sum of the degrees (in G) of the vertices of A ... All graphs are either regular or almost regular. The vertices are numbered 0, 1, ,n−1 and the i-th row represents the neighbors of the vertex in the first entry of t...

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

... replace the o(n −7/2 ) error term in the asymptotic expansion of B(n)/n!withO(n −9/2 ln 19 n). The following extension of Theorem 1 (the case m = 3) giving a complete asymptotic expansion of I(n, ... We then use the method of Laplace to give a complete asymptotic expansion of this integral in terms of the Bernoulli numbers and Hermite polynomials. Hence, we have the c...

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

... [7] Let G be a k-regular graph of girth at least g having the least number of vertices. Then the girth of G is g and the diameter of G is at most g. A proof of this theorem can be found in [14, ... g)-graph of minimum order. The problem of determining the order v(k, g) of a (k, g)-cage is unsolved for most pairs (k, g) and is extremely hard in the general case. By...

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

... (we follow the terminology of [4]). If G =(V,E)isak-critical graph, then the low-vertex subgraph of G, denoted by L(G), is the subgraph of G, induced by all vertices of degree k − 1. The high-vertex ... ingredient of our proof is the following result of Stiebitz. Lemma 3 ([5]) Let G be a k-critical graph containing at least one vertex of degree k − 1. Then the number...

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

... set. the electronic journal of combinatorics 7 (2000), #R58 4 Hence g k = 0 and γ(n, δ) ≤ γ ∗ (n, δ) ≤ k. The theorem therefore follows from the definition of δ k+1 (n) which is the maximum value of ... k.Butγ(n, δ k (n)) ≥ k by definition of δ k (n). The theorem therefore follows. In the next section we show that if k = 3 then the above theorem holds for n ≥ 6. Note that...

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

... +32t − 1. Then f(n) ≥ n +32t − 1, for n ≥ n t . This completes the proof of the theorem. From the above theorem, we have lim inf n→∞ f(n) − n √ n ≥  2+ 2562 6911 , which is better than the previous ... denote the number of vertices, and (G) denote the number of edges. In this paper, we construct a graph G having no two cycles with the same length which leads to the fol...

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

... number, the total number of partitions of the set [n]. the electronic journal of combinatorics 8 (2001), #R15 1 Since the coefficients of X(X − 1) ···(X − n + 1) are the (signed) Stirling numbers of the ... final section of our paper, we present a generalization of the first equality in Theorem 1. 2 Discussion of Theorem 2 We shall not give a proof of this theorem,...

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

... with the help of Prolog. Proposition 4.1. χ  G × +  ≥ 4. Proof. Let G 10 be the subgraph of G × + induced by the 10 vertices 6, 7, 8, 9, 12, 13, 14, 15, 20, and 36: the electronic journal of ... the table might suggest that the type 108 is a good candidate, but at least for a ≤ 10 9 , there are just the three 3-fans of type 108 given in the table. On the other hand...

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