首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We study the numerical index of absolute sums of Banach spaces, giving general conditions which imply that the numerical index of the sum is less or equal than the infimum of the numerical indices of the summands and we provide some examples where the equality holds covering the already known case of c0-, ?1- and ?-sums and giving as a new result the case of E-sums where E has the RNP and n(E)=1 (in particular for finite-dimensional E with n(E)=1). We also show that the numerical index of a Banach space Z which contains a dense union of increasing one-complemented subspaces is greater or equal than the limit superior of the numerical indices of those subspaces. Using these results, we give a detailed short proof of the already known fact that, for a fixed p, the numerical indices of all infinite-dimensional Lp(μ)-spaces coincide.  相似文献   

2.
Let IP(N) stand for an ideal containing finite sets. We discuss various kinds of statistical convergence and I-convergence for sequences of functions with values in R or in a metric space. For real valued measurable functions defined on a measure space (X,M,μ), we obtain a statistical version of the Egorov theorem (when μ(X)<∞). We show that, in its assertion, equi-statistical convergence on a big set cannot be replaced by uniform statistical convergence. Also, we consider statistical convergence in measure and I-convergence in measure, with some consequences of the Riesz theorem. We prove that outer and inner statistical convergences in measure (for sequences of measurable functions) are equivalent if the measure is finite.  相似文献   

3.
We adapt recent results of Albrecht and Ricker to obtain conditions under which growth constraints on the left resolvent of a Banach space operator are preserved under suitable perturbations. As an application, we establish Bishop's property (β) for certain generalized Cesàro operators on the classical Hardy spaces Hp, 1<p<∞. Our methods also apply to unilateral weighted shifts whose weight sequence converges sufficiently rapidly as well as to perturbations of restrictions of a class of generalized scalar operators.  相似文献   

4.
Elementary trigonometric quantities are defined in l2,p analogously to that in l2,2, the sine and cosine functions are generalized for each p>0 as functions sinp and cosp such that they satisfy the basic equation p|cosp(φ)|+p|sinp(φ)|=1. The p-generalized radius coordinate of a point ξRn is defined for each p>0 as . On combining these quantities, ln,p-spherical coordinates are defined. It is shown that these coordinates are nearly related to ln,p-simplicial coordinates. The Jacobians of these generalized coordinate transformations are derived. Applications and interpretations from analysis deal especially with the definition of a generalized surface content on ln,p-spheres which is nearly related to a modified co-area formula and an extension of Cavalieri's and Torricelli's indivisibeln method, and with differential equations. Applications from probability theory deal especially with a geometric interpretation of the uniform probability distribution on the ln,p-sphere and with the derivation of certain generalized statistical distributions.  相似文献   

5.
We study the smoothness property of a function f with absolutely convergent Fourier series, and give best possible sufficient conditions in terms of its Fourier coefficients to ensure that f belongs to one of the Zygmund classes Λ(α) and λ(α) for some 0<α?2. This paper is a natural supplement to our earlier one [F. Móricz, Absolutely convergent Fourier series and function classes, J. Math. Anal. Appl. 324 (2) (2006) 1168-1177] under the same title, and we keep its notations.  相似文献   

6.
Given a finite set E and a family F={E1,…,Em} of subsets of E such that F covers E, the famous unicost set covering problem (USCP) is to determine the smallest possible subset of F that also covers E. We study in this paper a variant, called the Large Set Covering Problem (LSCP), which differs from the USCP in that E and the subsets Ei are not given in extension because they are very large sets that are possibly infinite. We propose three exact algorithms for solving the LSCP. Two of them determine minimal covers, while the third one produces minimum covers. Heuristic versions of these algorithms are also proposed and analysed. We then give several procedures for the computation of a lower bound on the minimum size of a cover. We finally present algorithms for finding the largest possible subset of F that does not cover E. We also show that a particular case of the LSCP is to determine irreducible infeasible sets in inconsistent constraint satisfaction problems. All concepts presented in the paper are illustrated on the k-colouring problem which is formulated as a constraint satisfaction problem.  相似文献   

7.
Let G=(V,E) be a finite, simple and non-empty (p,q)-graph of order p and size q. An (a,d)-vertex-antimagic total labeling is a bijection f from V(G)∪E(G) onto the set of consecutive integers 1,2,…,p+q, such that the vertex-weights form an arithmetic progression with the initial term a and the common difference d, where the vertex-weight of x is the sum of values f(xy) assigned to all edges xy incident to vertex x together with the value assigned to x itself, i.e. f(x). Such a labeling is called super if the smallest possible labels appear on the vertices.In this paper, we will study the properties of such labelings and examine their existence for disconnected graphs.  相似文献   

8.
Let X be a Banach space and Z a nonempty subset of X. Let J:ZR be a lower semicontinuous function bounded from below and p?1. This paper is concerned with the perturbed optimization problem of finding z0Z such that ‖xz0p+J(z0)=infzZ{‖xzp+J(z)}, which is denoted by minJ(x,Z). The notions of the J-strictly convex with respect to Z and of the Kadec with respect to Z are introduced and used in the present paper. It is proved that if X is a Kadec Banach space with respect to Z and Z is a closed relatively boundedly weakly compact subset, then the set of all xX for which every minimizing sequence of the problem minJ(x,Z) has a converging subsequence is a dense Gδ-subset of X?Z0, where Z0 is the set of all points zZ such that z is a solution of the problem minJ(z,Z). If additionally p>1 and X is J-strictly convex with respect to Z, then the set of all xX for which the problem minJ(x,Z) is well-posed is a dense Gδ-subset of X?Z0.  相似文献   

9.
We study the smoothness property of a function f with absolutely convergent Fourier series, and give best possible sufficient conditions in terms of its Fourier coefficients to ensure that f belongs either to one of the Lipschitz classes Lip(α) and lip(α) for some 0<α?1, or to one of the Zygmund classes Λ(1) and λ(1). Our theorems generalize some of those by Boas [R.P. Boas Jr., Fourier series with positive coefficients, J. Math. Anal. Appl. 17 (1967) 463-483] and one by Németh [J. Németh, Fourier series with positive coefficients and generalized Lipschitz classes, Acta Sci. Math. (Szeged) 54 (1990) 291-304]. We also prove a localized version of a theorem by Paley [R.E.A.C. Paley, On Fourier series with positive coefficients, J. London Math. Soc. 7 (1932) 205-208] on the existence and continuity of the derivative of f.  相似文献   

10.
Consider a matroid M=(E,B), where B denotes the family of bases of M, and assign a color c(e) to every element eE (the same color can go to more than one element). The palette of a subset F of E, denoted by c(F), is the image of F under c. Assume also that colors have prices (in the form of a function π(?), where ? is the label of a color), and define the chromatic price as: π(F)=∑?∈c(F)π(?). We consider the following problem: find a base BB such that π(B) is minimum. We show that the greedy algorithm delivers a lnr(M)-approximation of the unknown optimal value, where r(M) is the rank of matroid M. By means of a reduction from SETCOVER, we prove that the lnr(M) ratio cannot be further improved, even in the special case of partition matroids, unless . The results apply to the special case where M is a graphic matroid and where the prices π(?) are restricted to be all equal. This special case was previously known as the minimum label spanning tree (MLST) problem. For the MLST, our results improve over the ln(n-1)+1 ratio achieved by Wan, Chen and Xu in 2002. Inspired by the generality of our results, we study the approximability of coloring problems with different objective function π(F), where F is a common independent set on matroids M1,…,Mk and, more generally, to independent systems characterized by the k-for-1 property.  相似文献   

11.
We study boundary trace embedding theorems for variable exponent Sobolev space W1,p(⋅)(Ω). Let Ω be an open (bounded or unbounded) domain in RN satisfying strong local Lipschitz condition. Under the hypotheses that pL(Ω), 1?infp(x)?supp(x)<N, |∇p|∈Lγ(⋅)(Ω), where γL(Ω) and infγ(x)>N, we prove that there is a continuous boundary trace embedding W1,p(⋅)(Ω)→Lq(⋅)(∂Ω) provided q(⋅), a measurable function on ∂Ω, satisfies condition for x∈∂Ω.  相似文献   

12.
Lim's theorems for multivalued mappings in CAT(0) spaces   总被引:1,自引:0,他引:1  
Let X be a complete CAT(0) space. We prove that, if E is a nonempty bounded closed convex subset of X and a nonexpansive mapping satisfying the weakly inward condition, i.e., there exists pE such that ∀xE, ∀α∈[0,1], then T has a fixed point. In Banach spaces, this is a result of Lim [On asymptotic centers and fixed points of nonexpansive mappings, Canad. J. Math. 32 (1980) 421-430]. The related result for unbounded R-trees is given.  相似文献   

13.
Let M be a von Neumann algebra equipped with a normal semifinite faithful trace τ. Let T be a positive linear contraction on M such that τT?τ and such that the numerical range of T as an operator on L2(M) is contained in a Stoltz region with vertex 1. We show that Junge and Xu's noncommutative Stein maximal ergodic inequality holds for the powers of T on Lp(M), 1<p?∞. We apply this result to obtain the noncommutative analogue of a recent result of Cohen concerning the iterates of the product of a finite number of conditional expectations.  相似文献   

14.
In recent papers (cf. [J.L. Arregui, O. Blasco, (p,q)-Summing sequences, J. Math. Anal. Appl. 274 (2002) 812-827; J.L. Arregui, O. Blasco, (p,q)-Summing sequences of operators, Quaest. Math. 26 (2003) 441-452; S. Aywa, J.H. Fourie, On summing multipliers and applications, J. Math. Anal. Appl. 253 (2001) 166-186; J.H. Fourie, I. Röntgen, Banach space sequences and projective tensor products, J. Math. Anal. Appl. 277 (2) (2003) 629-644]) the concept of (p,q)-summing multiplier was considered in both general and special context. It has been shown that some geometric properties of Banach spaces and some classical theorems can be described using spaces of (p,q)-summing multipliers. The present paper is a continuation of this study, whereby multiplier spaces for some classical Banach spaces are considered. The scope of this research is also broadened, by studying other classes of summing multipliers. Let E(X) and F(Y) be two Banach spaces whose elements are sequences of vectors in X and Y, respectively, and which contain the spaces c00(X) and c00(Y) of all X-valued and Y-valued sequences which are eventually zero, respectively. Generally spoken, a sequence of bounded linear operators (un)⊂L(X,Y) is called a multiplier sequence from E(X) to F(Y) if the linear operator from c00(X) into c00(Y) which maps (xi)∈c00(X) onto (unxn)∈c00(Y) is bounded with respect to the norms on E(X) and F(Y), respectively. Several cases where E(X) and F(Y) are different (classical) spaces of sequences, including, for instance, the spaces Rad(X) of almost unconditionally summable sequences in X, are considered. Several examples, properties and relations among spaces of summing multipliers are discussed. Important concepts like R-bounded, semi-R-bounded and weak-R-bounded from recent papers are also considered in this context.  相似文献   

15.
S. Mishra  S.B. Rao 《Discrete Mathematics》2006,306(14):1586-1594
In this paper we consider a graph optimization problem called minimum monopoly problem, in which it is required to find a minimum cardinality set SV, such that, for each uV, |N[u]∩S|?|N[u]|/2 in a given graph G=(V,E). We show that this optimization problem does not have a polynomial-time approximation scheme for k-regular graphs (k?5), unless P=NP. We show this by establishing two L-reductions (an approximation preserving reduction) from minimum dominating set problem for k-regular graphs to minimum monopoly problem for 2k-regular graphs and to minimum monopoly problem for (2k-1)-regular graphs, where k?3. We also show that, for tree graphs, a minimum monopoly set can be computed in linear time.  相似文献   

16.
17.
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<∞.  相似文献   

18.
We study the boundary value problem in Ω, u=0 on ∂Ω, where Ω is a smooth bounded domain in RN (N?3) and is a p(x)-Laplace type operator with p(.):Ω→[1,+∞) a measurable function and b a continuous and nondecreasing function from RR. We prove the existence and uniqueness of an entropy solution for L1-data f.  相似文献   

19.
We study the long time behavior of solutions for damped wave equations with absorption. These equations are generally accepted as models of wave propagation in heterogeneous media with space-time dependent friction a(t,x)ut and nonlinear absorption |u|p−1u (Ikawa (2000) [17]). We consider 1<p<(n+2)/(n−2) and separable a(t,x)=λ(x)η(t) with λ(x)∼(1+|x|)α and η(t)∼(1+t)β satisfying conditions (A1) or (A2) which are given. The main results are precise decay estimates for the energy, L2 and Lp+1 norms of solutions. We also observe the following behavior: if α∈[0,1), β∈(−1,1) and 0<α+β<1, there are three different regions for the decay of solutions depending on p; if α∈(−,0) and β∈(−1,1), there are only two different regions for the decay of the solutions depending on p.  相似文献   

20.
Given a graph G and integers p,q,d1 and d2, with p>q, d2>d1?1, an L(d1,d2;p,q)-labeling of G is a function f:V(G)→{0,1,2,…,n} such that |f(u)−f(v)|?p if dG(u,v)?d1 and |f(u)−f(v)|?q if dG(u,v)?d2. A k-L(d1,d2;p,q)-labeling is an L(d1,d2;p,q)-labeling f such that maxvV(G)f(v)?k. The L(d1,d2;p,q)-labeling number ofG, denoted by , is the smallest number k such that G has a k-L(d1,d2;p,q)-labeling. In this paper, we give upper bounds and lower bounds of the L(d1,d2;p,q)-labeling number for general graphs and some special graphs. We also discuss the L(d1,d2;p,q)-labeling number of G, when G is a path, a power of a path, or Cartesian product of two paths.  相似文献   

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

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