It is shown that r(W_m, K_n)≤(1+o(1))C_1n log n 2m-2m-2 for fixed even m≥4 and n→∞, and r(W_m, K_n)≤(1+o(1))C_2n 2mm+1 log n m+1m-1 for fixed odd m≥5 and n→∞, wher...It is shown that r(W_m, K_n)≤(1+o(1))C_1n log n 2m-2m-2 for fixed even m≥4 and n→∞, and r(W_m, K_n)≤(1+o(1))C_2n 2mm+1 log n m+1m-1 for fixed odd m≥5 and n→∞, where C_1=C_1(m)>0 and C_2=C_2(m)>0, in particular, C_2=12 if m=5 . It is obtained by the analytic method and using the function f_m(x)=∫ 1 _ 0 (1-t) 1m dtm+(x-m)t , x≥0 , m≥1 on the base of the asymptotic upper bounds for r(C_m, K_n) which were given by Caro, et al. Also, cn log n 52 ≤r(K_4, K_n)≤(1+o(1)) n 3 ( log n) 2 (as n→∞ ). Moreover, we give r(K_k+C_m, K_n)≤(1+o(1))C_5(m)n log n k+mm-2 for fixed even m≥4 and r(K_k+C_m, K_n)≤(1+o(1))C_6(m)n 2+(k+1)(m-1)2+k(m-1) log n k+2m-1 for fixed odd m≥3 (as n→∞ ).展开更多
We give some theorems of strong law of large numbers and complete convergence for sequences of φ-mixing random variables. In particular, Wittmann＇s strong law of large numbers and Teicher＇s strong law of large nnum...We give some theorems of strong law of large numbers and complete convergence for sequences of φ-mixing random variables. In particular, Wittmann＇s strong law of large numbers and Teicher＇s strong law of large nnumbers for independent random variables are generalized to the case of φ -minxing random variables.展开更多
The well known Zarankiewicz' conjecture is said that the crossing number of the complete bipartite graph Km,n (m≤n) is Z(m,n). where Z(m,n) = [m/2] [(m-1)/2] [n/2] [(n-1)/2](for and real number x, [x] denotes the...The well known Zarankiewicz' conjecture is said that the crossing number of the complete bipartite graph Km,n (m≤n) is Z(m,n). where Z(m,n) = [m/2] [(m-1)/2] [n/2] [(n-1)/2](for and real number x, [x] denotes the maximal integer no more than x). Presently, Zarankiewicz' conjecture is proved true only for the case m≤G. In this article, the authors prove that if Zarankiewicz' conjecture holds for m≤9, then the crossing number of the complete tripartite graph K1,8,n is Z(9, n) + 12[n/2].展开更多
The bondage number of γ f, b f(G) , is defined to be the minimum cardinality of a set of edges whose removal from G results in a graph G′ satisfying γ f(G′)> γ f(G) . The reinforcement number of γ f, ...The bondage number of γ f, b f(G) , is defined to be the minimum cardinality of a set of edges whose removal from G results in a graph G′ satisfying γ f(G′)> γ f(G) . The reinforcement number of γ f, r f(G) , is defined to be the minimum cardinality of a set of edges which when added to G results in a graph G′ satisfying γ f(G′)< γ f(G) . G.S.Domke and R.C.Laskar initiated the study of them and gave exact values of b f(G) and r f(G) for some classes of graphs. Exact values of b f(G) and r f(G) for complete multipartite graphs are given and some results are extended.展开更多
In this paper, the complete convergence and weak law of large numbers are established for ρ-mixing sequences of random variables. Our results extend and improve the Baum and Katz complete convergence theorem and the ...In this paper, the complete convergence and weak law of large numbers are established for ρ-mixing sequences of random variables. Our results extend and improve the Baum and Katz complete convergence theorem and the classical weak law of large numbers, etc. from independent sequences of random variables to ρ-mixing sequences of random variables without necessarily adding any extra conditions.展开更多
Let G be a maximal outerplane graph and X0(G) the complete chromatic number of G. This paper determines exactly X0(G) for △(G)≠5 and proves 6≤X0.(G)≤7 for △(G) = 5, where △(G) is the maximum degree of vertices o...Let G be a maximal outerplane graph and X0(G) the complete chromatic number of G. This paper determines exactly X0(G) for △(G)≠5 and proves 6≤X0.(G)≤7 for △(G) = 5, where △(G) is the maximum degree of vertices of G.展开更多
Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints....Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C（x） denote the set of colors of vertex x and of the edges incident with x, we call C（x） the color set of x. If C（u） ≠ C（v） for any two different vertices u and v of V （G）, then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by Хvt^e（G） and is called the VDE T chromatic number of G. The VDET coloring of complete bipartite graph K7,n （7 ≤ n ≤ 95） is discussed in this paper and the VDET chromatic number of K7,n （7 ≤ n ≤ 95） has been obtained.展开更多
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of verte...Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.展开更多
When linearizing three-dimensional(3 D)coordinate similarity transformation model with large rotations,we usually encounter the ill-posed normal matrix which may aggravate the instability of solutions.To alleviate the...When linearizing three-dimensional(3 D)coordinate similarity transformation model with large rotations,we usually encounter the ill-posed normal matrix which may aggravate the instability of solutions.To alleviate the problem,a series of conversions are contributed to the 3 D coordinate similarity transformation model in this paper.We deduced a complete solution for the 3 D coordinate similarity transformation at any rotation with the nonlinear adjustment methodology,which involves the errors of the common and the non-common points.Furthermore,as the large condition number of the normal matrix resulted in an intractable form,we introduced the bary-centralization technique and a surrogate process for deterministic element of the normal matrix,and proved its benefit for alleviating the condition number.The experimental results show that our approach can obtain the smaller condition number to stabilize the convergence of the interested parameters.Especially,our approach can be implemented for considering the errors of the common and the non-common points,thus the accuracy of the transformed coordinates improves.展开更多
In this paper, we derive the complete asymptotic expansion of classical Baskakov operators Vn （f;x） in the form of all coefficients of n^-k, k = 0, 1... being calculated explic- itly in terms of Stirling number of t...In this paper, we derive the complete asymptotic expansion of classical Baskakov operators Vn （f;x） in the form of all coefficients of n^-k, k = 0, 1... being calculated explic- itly in terms of Stirling number of the first and second kind and another number G（i, p）. As a corollary, we also get the Voronovskaja-type result for the operators.展开更多
In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones...In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones of independent sequence with identical distribution to the case of φ-mixing sequence with different distribution.展开更多
Degenerate versions of special polynomials and numbers applied to social problems,physics,and applied mathematics have been studied variously in recent years.Moreover,the(s-)Lah numbers have many other interesting app...Degenerate versions of special polynomials and numbers applied to social problems,physics,and applied mathematics have been studied variously in recent years.Moreover,the(s-)Lah numbers have many other interesting applications in analysis and combinatorics.In this paper,we divide two parts.We first introduce new types of both degenerate incomplete and complete s-Bell polynomials respectively and investigate some properties of them respectively.Second,we introduce the degenerate versions of complete and incomplete Lah-Bell polynomials as multivariate forms for a new type of degenerate s-extended Lah-Bell polynomials and numbers respectively.We investigate relations between these polynomials and degenerate incomplete and complete s-Bell polynomials,and derive explicit formulas for these polynomials.展开更多
In this paper,by deriving an inequality involving the generating function of the Bernoulli numbers,the author introduces a new ratio of finitely many gamma functions,finds complete monotonicity of the second logarithm...In this paper,by deriving an inequality involving the generating function of the Bernoulli numbers,the author introduces a new ratio of finitely many gamma functions,finds complete monotonicity of the second logarithmic derivative of the ratio,and simply reviews the complete monotonicity of several linear combinations of finitely many digamma or trigamma functions.展开更多
In this paper, we derive the Baskakov-Kantorovich operators Vn（f; x） the complete asymptotic expansion in the form of all coefficients of n^-k, k =0, 1 … being calculated explicitly. As a corollary, we also get the...In this paper, we derive the Baskakov-Kantorovich operators Vn（f; x） the complete asymptotic expansion in the form of all coefficients of n^-k, k =0, 1 … being calculated explicitly. As a corollary, we also get the Voronovskaja-type result for the operators.展开更多
A packing of the complete directed symmetric graph DK v with m circuits, denoted by ( v,m) DCP, is defined to be a family of arc disjoint m circuits of DK v such that any one arc of DK v \ occurs...A packing of the complete directed symmetric graph DK v with m circuits, denoted by ( v,m) DCP, is defined to be a family of arc disjoint m circuits of DK v such that any one arc of DK v \ occurs in at most one m circuit. The packing number P(v,m) is the maximum number of m circuits in such a packing. The packing problem is to determine the value P(v,m) for every integer v≥m. In this paper, the problem is reduced to the case m+6≤v≤2m- 4m-3+12 , for any fixed even integer m≥4 . In particular, the values of P(v,m) are completely determined for m=12 , 14 and 16.展开更多
In this study,using the method of contradiction and the pre-assignment of chromatic sets,we discuss the E-total coloring of complete bipartite graphs K_(5,n)(5≤n≤7 113) which are vertex-distinguished by multiple set...In this study,using the method of contradiction and the pre-assignment of chromatic sets,we discuss the E-total coloring of complete bipartite graphs K_(5,n)(5≤n≤7 113) which are vertex-distinguished by multiple sets.The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined.展开更多
With positive integers r,t and n,where n≥rt and t≥2,the maximum number of edges of a simple graph of order n is estimated,which does not contain r disjoint copies of K_r for r=2 and 3.
文摘It is shown that r(W_m, K_n)≤(1+o(1))C_1n log n 2m-2m-2 for fixed even m≥4 and n→∞, and r(W_m, K_n)≤(1+o(1))C_2n 2mm+1 log n m+1m-1 for fixed odd m≥5 and n→∞, where C_1=C_1(m)>0 and C_2=C_2(m)>0, in particular, C_2=12 if m=5 . It is obtained by the analytic method and using the function f_m(x)=∫ 1 _ 0 (1-t) 1m dtm+(x-m)t , x≥0 , m≥1 on the base of the asymptotic upper bounds for r(C_m, K_n) which were given by Caro, et al. Also, cn log n 52 ≤r(K_4, K_n)≤(1+o(1)) n 3 ( log n) 2 (as n→∞ ). Moreover, we give r(K_k+C_m, K_n)≤(1+o(1))C_5(m)n log n k+mm-2 for fixed even m≥4 and r(K_k+C_m, K_n)≤(1+o(1))C_6(m)n 2+(k+1)(m-1)2+k(m-1) log n k+2m-1 for fixed odd m≥3 (as n→∞ ).
基金Supported by the National Natural Science Foundation of China (10671149)
文摘We give some theorems of strong law of large numbers and complete convergence for sequences of φ-mixing random variables. In particular, Wittmann＇s strong law of large numbers and Teicher＇s strong law of large nnumbers for independent random variables are generalized to the case of φ -minxing random variables.
基金This work is supported by the Key Project of the Education Department of Hunan Province of China (05A037)by Scientific Research Fund of Hunan Provincial Education Department (06C515).
文摘The well known Zarankiewicz' conjecture is said that the crossing number of the complete bipartite graph Km,n (m≤n) is Z(m,n). where Z(m,n) = [m/2] [(m-1)/2] [n/2] [(n-1)/2](for and real number x, [x] denotes the maximal integer no more than x). Presently, Zarankiewicz' conjecture is proved true only for the case m≤G. In this article, the authors prove that if Zarankiewicz' conjecture holds for m≤9, then the crossing number of the complete tripartite graph K1,8,n is Z(9, n) + 12[n/2].
文摘The bondage number of γ f, b f(G) , is defined to be the minimum cardinality of a set of edges whose removal from G results in a graph G′ satisfying γ f(G′)> γ f(G) . The reinforcement number of γ f, r f(G) , is defined to be the minimum cardinality of a set of edges which when added to G results in a graph G′ satisfying γ f(G′)< γ f(G) . G.S.Domke and R.C.Laskar initiated the study of them and gave exact values of b f(G) and r f(G) for some classes of graphs. Exact values of b f(G) and r f(G) for complete multipartite graphs are given and some results are extended.
文摘In this paper, the complete convergence and weak law of large numbers are established for ρ-mixing sequences of random variables. Our results extend and improve the Baum and Katz complete convergence theorem and the classical weak law of large numbers, etc. from independent sequences of random variables to ρ-mixing sequences of random variables without necessarily adding any extra conditions.
基金Project supported by the Vatural SCience Foundation of LNEC.
文摘Let G be a maximal outerplane graph and X0(G) the complete chromatic number of G. This paper determines exactly X0(G) for △(G)≠5 and proves 6≤X0.(G)≤7 for △(G) = 5, where △(G) is the maximum degree of vertices of G.
文摘Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C（x） denote the set of colors of vertex x and of the edges incident with x, we call C（x） the color set of x. If C（u） ≠ C（v） for any two different vertices u and v of V （G）, then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by Хvt^e（G） and is called the VDE T chromatic number of G. The VDET coloring of complete bipartite graph K7,n （7 ≤ n ≤ 95） is discussed in this paper and the VDET chromatic number of K7,n （7 ≤ n ≤ 95） has been obtained.
基金Supported by the National Natural Science Foundation of China（61163037, 61163054, 11261046, 61363060）
文摘Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.
基金supported by the National Natural Science Foundation of China,Nos.41874001 and 41664001Support Program for Outstanding Youth Talents in Jiangxi Province,No.20162BCB23050National Key Research and Development Program,No.2016YFB0501405。
文摘When linearizing three-dimensional(3 D)coordinate similarity transformation model with large rotations,we usually encounter the ill-posed normal matrix which may aggravate the instability of solutions.To alleviate the problem,a series of conversions are contributed to the 3 D coordinate similarity transformation model in this paper.We deduced a complete solution for the 3 D coordinate similarity transformation at any rotation with the nonlinear adjustment methodology,which involves the errors of the common and the non-common points.Furthermore,as the large condition number of the normal matrix resulted in an intractable form,we introduced the bary-centralization technique and a surrogate process for deterministic element of the normal matrix,and proved its benefit for alleviating the condition number.The experimental results show that our approach can obtain the smaller condition number to stabilize the convergence of the interested parameters.Especially,our approach can be implemented for considering the errors of the common and the non-common points,thus the accuracy of the transformed coordinates improves.
基金Supported by the Natural Science Foundation of Beijing(1072006)
文摘In this paper, we derive the complete asymptotic expansion of classical Baskakov operators Vn （f;x） in the form of all coefficients of n^-k, k = 0, 1... being calculated explic- itly in terms of Stirling number of the first and second kind and another number G（i, p）. As a corollary, we also get the Voronovskaja-type result for the operators.
基金Supported by the National Natural Science Foundation of China（11671012, 11526033, 11501004, 11501005） Supported by the Natural Science Foundation of Anhui Province（1608085QA02） Supported by the Science Fund for Distinguished Young Scholars of Anhui Province（1508085J06）
文摘In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones of independent sequence with identical distribution to the case of φ-mixing sequence with different distribution.
基金supported by the Basic Science Research Program,the National Research Foundation of Korea(NRF-2021R1F1A1050151).
文摘Degenerate versions of special polynomials and numbers applied to social problems,physics,and applied mathematics have been studied variously in recent years.Moreover,the(s-)Lah numbers have many other interesting applications in analysis and combinatorics.In this paper,we divide two parts.We first introduce new types of both degenerate incomplete and complete s-Bell polynomials respectively and investigate some properties of them respectively.Second,we introduce the degenerate versions of complete and incomplete Lah-Bell polynomials as multivariate forms for a new type of degenerate s-extended Lah-Bell polynomials and numbers respectively.We investigate relations between these polynomials and degenerate incomplete and complete s-Bell polynomials,and derive explicit formulas for these polynomials.
基金partially supported by the National Nature Science Foundation of China(12061033)。
文摘In this paper,by deriving an inequality involving the generating function of the Bernoulli numbers,the author introduces a new ratio of finitely many gamma functions,finds complete monotonicity of the second logarithmic derivative of the ratio,and simply reviews the complete monotonicity of several linear combinations of finitely many digamma or trigamma functions.
基金Supported by the Natural Science Foundation of Beijing(1072006)Supported by NSFC(10871017)
文摘In this paper, we derive the Baskakov-Kantorovich operators Vn（f; x） the complete asymptotic expansion in the form of all coefficients of n^-k, k =0, 1 … being calculated explicitly. As a corollary, we also get the Voronovskaja-type result for the operators.
文摘A packing of the complete directed symmetric graph DK v with m circuits, denoted by ( v,m) DCP, is defined to be a family of arc disjoint m circuits of DK v such that any one arc of DK v \ occurs in at most one m circuit. The packing number P(v,m) is the maximum number of m circuits in such a packing. The packing problem is to determine the value P(v,m) for every integer v≥m. In this paper, the problem is reduced to the case m+6≤v≤2m- 4m-3+12 , for any fixed even integer m≥4 . In particular, the values of P(v,m) are completely determined for m=12 , 14 and 16.
基金Supported by the National Natural Science Foundation of China (11761064)。
文摘In this study,using the method of contradiction and the pre-assignment of chromatic sets,we discuss the E-total coloring of complete bipartite graphs K_(5,n)(5≤n≤7 113) which are vertex-distinguished by multiple sets.The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined.
文摘With positive integers r,t and n,where n≥rt and t≥2,the maximum number of edges of a simple graph of order n is estimated,which does not contain r disjoint copies of K_r for r=2 and 3.
