首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 531 毫秒
1.
2.
3.
4.
In this paper, we study free pluriharmonic functions on noncommutative balls γ[Bn(H)], γ>0, and their boundary behavior. These functions have the form
  相似文献   

5.
6.
Let K1,…,Kn be (infinite) non-negative matrices that define operators on a Banach sequence space. Given a function f:[0,)×…×[0,)→[0,) of n variables, we define a non-negative matrix and consider the inequality
  相似文献   

7.
We find lower bounds on the difference between the spectral radius λ1 and the average degree of an irregular graph G of order n and size e. In particular, we show that, if n ? 4, then
  相似文献   

8.
For any real number β>1, let ε(1,β)=(ε1(1),ε2(1),…,εn(1),…) be the infinite β-expansion of 1. Define . Let x∈[0,1) be an irrational number. We denote by kn(x) the exact number of partial quotients in the continued fraction expansion of x given by the first n digits in the β-expansion of x. If is bounded, we obtain that for all x∈[0,1)?Q,
  相似文献   

9.
For expansion by Jacobi polynomials we relate smoothness given by appropriate K-functionals in Lp, 1?p?2, to estimates on the coefficients in the ?q form. As a corollary for 1<p?2, and an the coefficients of the Legendre expansion of fLp[−1,1], we obtain the estimate
  相似文献   

10.
11.
12.
13.
Let A?B?0 with A>0, t∈[0,1] and p?1. Then we shall show that
  相似文献   

14.
Let G be a graph of order n and rank(G) denotes the rank of its adjacency matrix. Clearly, . In this paper we characterize all graphs G such that or n + 2. Also for every integer n ? 5 and any k, 0 ? k ? n, we construct a graph G of order n, such that .  相似文献   

15.
Let F be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of F in a graph with a prescribed number of vertices and edges. Our results extend those of Simonovits (1968) [8], who proved that there is one copy of F, and of Rademacher, Erd?s (1962) [1] and [2] and Lovász and Simonovits (1983) [4], who proved similar counting results when F is a complete graph.One of the simplest cases of our theorem is the following new result. There is an absolute positive constant c such that if n is sufficiently large and 1?q<cn, then every n vertex graph with ⌊n2/4⌋+q edges contains at least
  相似文献   

16.
Spectral radius of graphs with given matching number   总被引:2,自引:0,他引:2  
In this paper, we show that of all graphs of order n with matching number β, the graphs with maximal spectral radius are Kn if n = 2β or 2β + 1; if 2β + 2 ? n < 3β + 2; or if n = 3β + 2; if n > 3β + 2, where is the empty graph on t vertices.  相似文献   

17.
Suppose that K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E. Let be two nonself asymptotically nonexpansive mappings with sequences {kn},{ln}⊂[1,∞), limn→∞kn=1, limn→∞ln=1, , respectively. Suppose {xn} is generated iteratively by
  相似文献   

18.
Given {Pn}n≥0 a sequence of monic orthogonal polynomials, we analyze their linear combinations with constant coefficients and fixed length, i.e., 
  相似文献   

19.
We establish the following case of the Determinantal Conjecture of Marcus [M. Marcus, Derivations, Plücker relations and the numerical range, Indiana Univ. Math. J. 22 (1973) 1137-1149] and de Oliveira [G.N. de Oliveira, Research problem: Normal matrices, Linear and Multilinear Algebra 12 (1982) 153-154]. Let A and B be unitary n × n matrices with prescribed eigenvalues a1, … , an and b1, … , bn, respectively. Then for any scalars t and s
  相似文献   

20.
In this paper, we afford some sufficient conditions to guarantee   the existence of multiple positive solutions for the nonlinear m-point boundary value problem for the one-dimensional p-Laplacian
  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号