首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
For aj,bj?1, j=1,2,…,d, we prove that the operator maps into itself for , where , and k(x,y)=φ(x,y)eig(x,y), φ(x,y) satisfies (1.2) (e.g. φ(x,y)=|xy|iτ,τ real) and the phase g(x,y)=xayb. We study operators with more general phases and for these operators we require that aj,bj>1, j=1,2,…,d, or al=bl?1 for some l∈{1,2,…,d}.  相似文献   

2.
Let K be a generalized Calderón-Zygmund kernel defined on Rn×(Rn?{0}). The singular integral operator with variable kernel given by
  相似文献   

3.
Let be a strictly stationary sequence of positively associated random variables with mean zero and finite variance. Set , Mn=maxk?n|Sk|, n?1. Suppose . In this paper, we study the exact convergence rates of a kind of weighted infinite series of , and as ε↘0, respectively.  相似文献   

4.
Let m(n,k,r,t) be the maximum size of satisfying |F1∩?∩Fr|≥t for all F1,…,FrF. We prove that for every p∈(0,1) there is some r0 such that, for all r>r0 and all t with 1≤t≤⌊(p1−rp)/(1−p)⌋−r, there exists n0 so that if n>n0 and p=k/n, then . The upper bound for t is tight for fixed p and r.  相似文献   

5.
In this paper we deal with some Sobolev-type inequalities with weights that were proved by Maz'ya in [V.G. Maz'ja, Sobolev Spaces, Springer-Verlag, Berlin, 1980] and by Caffarelli, Kohn and Nirenberg in [L. Caffarelli, R. Kohn, L. Nirenberg, First order interpolation inequalities with weight, Compos. Math. 53 (1984) 259-275]. For integers 1?k?N denote points ξRN=Rk×RNk as pairs (x,y). Let p∈(1,N), q∈(p,p] and assume . Then there exists c>0 such that
  相似文献   

6.
For an integer n and a prime p, let . In this paper, we present a construction for vertex-transitive self-complementary k-uniform hypergraphs of order n for each integer n such that for every prime p, where ?=max{k(2),(k−1)(2)}, and consequently we prove that the necessary conditions on the order of vertex-transitive self-complementary uniform hypergraphs of rank k=2? or k=2?+1 due to Potoňick and Šajna are sufficient. In addition, we use Burnside’s characterization of transitive groups of prime degree to characterize the structure of vertex-transitive self-complementary k-hypergraphs which have prime order p in the case where k=2? or k=2?+1 and , and we present an algorithm to generate all of these structures. We obtain a bound on the number of distinct vertex-transitive self-complementary graphs of prime order , up to isomorphism.  相似文献   

7.
Let be the signed edge domination number of G. In 2006, Xu conjectured that: for any 2-connected graph G of order n(n≥2), . In this article we show that this conjecture is not true. More precisely, we show that for any positive integer m, there exists an m-connected graph G such that . Also for every two natural numbers m and n, we determine , where Km,n is the complete bipartite graph with part sizes m and n.  相似文献   

8.
Let w be a Muckenhoupt weight and be the weighted Hardy spaces. We use the atomic decomposition of and their molecular characters to show that the Bochner-Riesz means are bounded on for 0<p?1 and δ>max{n/p−(n+1)/2,[n/p]rw−1(rw−1)−(n+1)/2}, where rw is the critical index of w for the reverse Hölder condition. We also prove the boundedness of the maximal Bochner-Riesz means for 0<p?1 and δ>n/p−(n+1)/2.  相似文献   

9.
This work is a continuation of our previous work, in the present paper we study the generalized nonlinear initial-boundary Riemann problem with small BV data for linearly degenerate quasilinear hyperbolic systems of conservation laws with nonlinear boundary conditions in a half space . We prove the global existence and uniqueness of piecewise C1 solution containing only contact discontinuities to a class of the generalized nonlinear initial-boundary Riemann problem, which can be regarded as a small BV perturbation of the corresponding nonlinear initial-boundary Riemann problem, for general n×n linearly degenerate quasilinear hyperbolic system of conservation laws; moreover, this solution has a global structure similar to the one of the self-similar solution to the corresponding nonlinear initial-boundary Riemann problem. Some applications to quasilinear hyperbolic systems of conservation laws arising in the string theory and high energy physics are also given.  相似文献   

10.
In this paper, by using the atomic decomposition and molecular characterization of the homogeneous and non-homogeneous weighted Herz-type Hardy spaces , we obtain some weighted boundedness properties of the Bochner-Riesz operator and the maximal Bochner-Riesz operator on these spaces for α=n(1/p−1/q), 0<p?1 and 1<q<∞.  相似文献   

11.
Let G=(V,E) be a finite, simple and undirected graph. For SV, let δ(S,G)={(u,v)∈E:uS and vVS} be the edge boundary of S. Given an integer i, 1≤i≤|V|, let the edge isoperimetric value of G at i be defined as be(i,G)=minSV;|S|=i|δ(S,G)|. The edge isoperimetric peak of G is defined as be(G)=max1≤j≤|V|be(j,G). Let bv(G) denote the vertex isoperimetric peak defined in a corresponding way. The problem of determining a lower bound for the vertex isoperimetric peak in complete t-ary trees was recently considered in [Y. Otachi, K. Yamazaki, A lower bound for the vertex boundary-width of complete k-ary trees, Discrete Mathematics, in press (doi:10.1016/j.disc.2007.05.014)]. In this paper we provide bounds which improve those in the above cited paper. Our results can be generalized to arbitrary (rooted) trees.The depth d of a tree is the number of nodes on the longest path starting from the root and ending at a leaf. In this paper we show that for a complete binary tree of depth d (denoted as ), and where c1, c2 are constants. For a complete t-ary tree of depth d (denoted as ) and dclogt where c is a constant, we show that and where c1, c2 are constants. At the heart of our proof we have the following theorem which works for an arbitrary rooted tree and not just for a complete t-ary tree. Let T=(V,E,r) be a finite, connected and rooted tree — the root being the vertex r. Define a weight function w:VN where the weight w(u) of a vertex u is the number of its successors (including itself) and let the weight index η(T) be defined as the number of distinct weights in the tree, i.e η(T)=|{w(u):uV}|. For a positive integer k, let ?(k)=|{iN:1≤i≤|V|,be(i,G)≤k}|. We show that .  相似文献   

12.
For the sets , 1?p<∞, of positive finite Borel measures μ on the real axis with the set of algebraic polynomials P dense in Lp(R,dμ), we establish a majorization principle of their “boundaries,” i.e. for every there exists such that dμ/dν?1. A corresponding principle holds for the sets , p>0, of non-negative upper semi-continuous on R functions (weights) w such that P is dense in the space : For every there exists such that w?ω.  相似文献   

13.
Let X be a Banach space and C a bounded, closed, convex subset of X. C is said to have the weak-approximate fixed point property if for any norm-continuous mapping , there exists a sequence {xn} in C such that (xnfn(xn)) converges to 0 weakly. It is known that every infinite-dimensional Banach space with the Schur property does not have the weak-approximate fixed point property. In this article, we show that every Asplund space has the weak-approximate fixed point property. Applications to the asymptotic fixed point theory are given.  相似文献   

14.
15.
It is proved that the Hörmander and spaces (Ω1Rn, Ω2Rm open sets, 1?p<∞, ki Beurling-Björck weights, k=k1k2) are isomorphic whereas the iterated spaces and are not if 1<pq<∞. A similar result for weighted Lp-spaces of entire analytic functions is also obtained. Finally a result on iterated Besov spaces is given: and are not isomorphic when 1<q≠2<∞.  相似文献   

16.
A nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (simple) graph G of order n having degree sequence π. In this case, G is said to realizeπ. For a given graph H, a graphic sequence π is potentiallyH-graphic if there is some realization of π containing H as a (weak) subgraph. Let σ(π) denote the sum of the terms of π. For a graph H and nZ+, σ(H,n) is defined as the smallest even integer m so that every n-term graphic sequence π with σ(π)≥m is potentially H-graphic. Let denote the complete t partite graph such that each partite set has exactly s vertices. We show that and obtain the exact value of σ(Kj+Ks,s,n) for n sufficiently large. Consequently, we obtain the exact value of for n sufficiently large.  相似文献   

17.
A (d,1)-total labelling of a graph G assigns integers to the vertices and edges of G such that adjacent vertices receive distinct labels, adjacent edges receive distinct labels, and a vertex and its incident edges receive labels that differ in absolute value by at least d. The span of a (d,1)-total labelling is the maximum difference between two labels. The (d,1)-total number, denoted , is defined to be the least span among all (d,1)-total labellings of G. We prove new upper bounds for , compute some for complete bipartite graphs Km,n, and completely determine all for d=1,2,3. We also propose a conjecture on an upper bound for in terms of the chromatic number and the chromatic index of G.  相似文献   

18.
A graph X, with a subgroup G of the automorphism group of X, is said to be (G,s)-transitive, for some s≥1, if G is transitive on s-arcs but not on (s+1)-arcs, and s-transitive if it is -transitive. Let X be a connected (G,s)-transitive graph, and Gv the stabilizer of a vertex vV(X) in G. If X has valency 5 and Gv is solvable, Weiss [R.M. Weiss, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979) 43-48] proved that s≤3, and in this paper we prove that Gv is isomorphic to the cyclic group Z5, the dihedral group D10 or the dihedral group D20 for s=1, the Frobenius group F20 or F20×Z2 for s=2, or F20×Z4 for s=3. Furthermore, it is shown that for a connected 1-transitive Cayley graph of valency 5 on a non-abelian simple group G, the automorphism group of is the semidirect product , where R(G) is the right regular representation of G and .  相似文献   

19.
An r-graph is a loopless undirected graph in which no two vertices are joined by more than r edges. An r-complete graph on m+1 vertices, denoted by , is an r-graph on m+1 vertices in which each pair of vertices is joined by exactly r edges. A non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is r-graphic if it is realizable by an r-graph on n vertices. Let be the smallest even integer such that each n-term r-graphic sequence with term sum of at least is realizable by an r-graph containing as a subgraph. In this paper, we determine the value of for sufficiently large n, which generalizes a conjecture due to Erd?s, Jacobson and Lehel.  相似文献   

20.
In this paper, we first give several operator identities involving the bivariate Rogers-Szegö polynomials. By applying the technique of parameter augmentation to the multiple q-binomial theorems given by Milne [S.C. Milne, Balanced summation theorems for U(n) basic hypergeometric series, Adv. Math. 131 (1997) 93-187], we obtain several new multiple q-series identities involving the bivariate Rogers-Szegö polynomials. These include multiple extensions of Mehler's formula and Rogers's formula. Our U(n+1) generalizations are quite natural as they are also a direct and immediate consequence of their (often classical) known one-variable cases and Milne's fundamental theorem for An or U(n+1) basic hypergeometric series in Theorem 1.49 of [S.C. Milne, An elementary proof of the Macdonald identities for , Adv. Math. 57 (1985) 34-70], as rewritten in Lemma 7.3 on p. 163 of [S.C. Milne, Balanced summation theorems for U(n) basic hypergeometric series, Adv. Math. 131 (1997) 93-187] or Corollary 4.4 on pp. 768-769 of [S.C. Milne, M. Schlosser, A new An extension of Ramanujan's summation with applications to multilateral An series, Rocky Mountain J. Math. 32 (2002) 759-792].  相似文献   

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

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