期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
A GENERAL VERSION OF KALTON'S CLOSED GRAPH THEOREM 被引量:2
1
作者 丘京辉 《Acta Mathematica Scientia》 SCIE CSCD 1995年第2期161-170,共10页
By investigating the properties of Hellinger-Toeplitz topologies, we establish a general version of Kalton's cioed graph theorem. From this general version, we deduce a number of new closed graph theorems, which a... By investigating the properties of Hellinger-Toeplitz topologies, we establish a general version of Kalton's cioed graph theorem. From this general version, we deduce a number of new closed graph theorems, which are convenient for application. Particularly we improve some results of Kalton. 展开更多
关键词 Locally convex spaces Mackey spaces closed graph theorems.
下载PDF
AN IMPROVED NONLINEAR CLOSED GRAPH THEOREM
2
作者 Lei Qiang Li Ronglu 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2007年第2期226-228,共3页
In this paper, a new nonlinear closed graph theorem is established, whose result improves substantially a recent-known important conclusion.
关键词 closed graph Fréchet space CONTINUITY
下载PDF
A NEW CLASS OF LOCALLY CONVEX SPACES AND THE GENERALIZATION OF KALTON'S CLOSED GRAPH THEOREM
3
作者 丘京辉 《Acta Mathematica Scientia》 SCIE 1985年第4期389-397,共9页
By introducing the notions of L-spaces and L_r-spaces, a complete generalization of Kalton's closed graph theorem is obtained. It points out the class of L_r-spaces is the maximal class of range spaces for the clo... By introducing the notions of L-spaces and L_r-spaces, a complete generalization of Kalton's closed graph theorem is obtained. It points out the class of L_r-spaces is the maximal class of range spaces for the closed graph theorem when the class of domain spaces is the class of Mackey spaces with weakly * sequentially complete dual.Some examples are constructed showing that the class of L_r-spaces is strictly larger than the class of separable B_r-complete spaces.Some properties of L-spaces and L_r-spaces are discussed and the relations between B-complete (resp. B_r-complete) spaces and L-spaces (resp. L_r-spaces) are given. 展开更多
关键词 A NEW CLASS OF LOCALLY CONVEX SPACES AND THE GENERALIZATION OF KALTON’S closed graph THEOREM
下载PDF
Coefficient Multipliers on Some Analytic Function Spaces
4
作者 YUE Xiu-kui 《Chinese Quarterly Journal of Mathematics》 CSCD 2012年第3期344-351,共8页
In this paper, we give some new results of the coefficient multiplier of some analytic function spaces, characterize the coefficient multiplier spaces (Hα, p Hβ q) and (Ap,α), Aq,β) with 0 < p ≤ 1, p ≤ q ≤∞... In this paper, we give some new results of the coefficient multiplier of some analytic function spaces, characterize the coefficient multiplier spaces (Hα, p Hβ q) and (Ap,α), Aq,β) with 0 < p ≤ 1, p ≤ q ≤∞, 0 ≤α < β < ∞ and show (Hα∞, Hβ∞) = Hβ-α1 with 0 < α < β < ∞. 展开更多
关键词 analytic function space Hadamaxd product MULTIPLIER closed graph theorem OPERATOR
下载PDF
Robinson-Ursescu Theorem in p-normed Spaces
5
作者 丘京辉 《Northeastern Mathematical Journal》 CSCD 2002年第3期209-219,共11页
For a convex set-valued map between p-normed (0 < p < 1) spaces, we give a criterion for its inverse to be locally Lipschitz of order p. From this we obtain the Robinson-Ursescu Theorem in p-normed spaces and th... For a convex set-valued map between p-normed (0 < p < 1) spaces, we give a criterion for its inverse to be locally Lipschitz of order p. From this we obtain the Robinson-Ursescu Theorem in p-normed spaces and the open mapping and closed graph theorems for closed convex set-valued maps. 展开更多
关键词 Robinson-Ursescu theorem open mapping and closed graph theorems convex set-valued map locally Lipschitz of order p p-normed space
下载PDF
Smallest Close to Regular Bipartite Graphs without an Almost Perfect Matching 被引量:2
6
作者 Lutz VOLKMANN Axel ZINGSEM 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2010年第8期1403-1412,共10页
A graph G is close to regular or more precisely a (d, d + k)-graph, if the degree of each vertex of G is between d and d + k. Let d ≥ 2 be an integer, and let G be a connected bipartite (d, d+k)-graph with par... A graph G is close to regular or more precisely a (d, d + k)-graph, if the degree of each vertex of G is between d and d + k. Let d ≥ 2 be an integer, and let G be a connected bipartite (d, d+k)-graph with partite sets X and Y such that |X|- |Y|+1. If G is of order n without an almost perfect matching, then we show in this paper that·n ≥ 6d +7 when k = 1,·n ≥ 4d+ 5 when k = 2,·n ≥ 4d+3 when k≥3.Examples will demonstrate that the given bounds on the order of G are the best possible. 展开更多
关键词 Almost perfect matching bipartite graph close to regular graph
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部