首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let Lq (1q<∞) be the space of functions f measurable on I=[−1,1] and integrable to the power q, with normL is the space of functions measurable on I with normWe denote by AC the set of all functions absolutely continuous on I. For nN, q[1,∞] we setWn,q={f:f(n−1)AC, f(n)Lq}.In this paper, we consider the problem of accuracy of constants A, B in the inequalities (1)|| f(m)||qA|| f||p+B|| f(m+k+1)||r, mN, kW; p,q,r[1,∞], fWm+k+1,r.  相似文献   

2.
We apply the techniques of monotone and relative rearrangements to the nonrearrangement invariant spaces Lp()(Ω) with variable exponent. In particular, we show that the maps uLp()(Ω)→k(t)u*Lp*()(0,measΩ) and uLp()(Ω)→u*Lp*()(0,measΩ) are locally -Hölderian (u* (resp. p*) is the decreasing (resp. increasing) rearrangement of u (resp. p)). The pointwise relations for the relative rearrangement are applied to derive the Sobolev embedding with eventually discontinuous exponents.  相似文献   

3.
Let E be a real reflexive Banach space with uniformly Gâteaux differentiable norm. Let K be a nonempty bounded closed and convex subset of E. Let T:KK be a strictly pseudo-contractive map and let L>0 denote its Lipschitz constant. Assume F(T){xK:Tx=x}≠0/ and let zF(T). Fix δ(0,1) and let δ* be such that δ*δL(0,1). Define , where δn(0,1) and limδn=0. Let {αn} be a real sequence in (0,1) which satisfies the following conditions: . For arbitrary x0,uK, define a sequence {xn}K by xn+1=αnu+(1−αn)Snxn. Then, {xn} converges strongly to a fixed point of T.  相似文献   

4.
Let K be a convex body in d (d2), and denote by Bn(K) the set of all polynomials pn in d of total degree n such that |pn|1 on K. In this paper we consider the following question: does there exist a p*nBn(K) which majorates every element of Bn(K) outside of K? In other words can we find a minimal γ1 and p*nBn(K) so that |pn(x)|γ |p*n(x)| for every pnBn(K) and x d\K? We discuss the magnitude of γ and construct the universal majorants p*n for evenn. It is shown that γ can be 1 only on ellipsoids. Moreover, γ=O(1) on polytopes and has at most polynomial growth with respect to n, in general, for every convex body K.  相似文献   

5.
6.
For a nonnegative, uniformly convex HC2(R2) with H(0)=0, if uC(Ω), ΩR2, is a viscosity solution of the Aronsson equation (1.7), then uC1(Ω). This generalizes the C1-regularity theorem on infinity harmonic functions in R2 by Savin [O. Savin, C1-regularity for infinity harmonic functions in dimensions two, Arch. Ration. Mech. Anal. 176 (3) (2005) 351–361] to the Aronsson equation.  相似文献   

7.
Suppose F is an arbitrary field. Let |F| be the number of the elements of F. Let Mn(F) be the space of all n×n matrices over F, and let Sn(F) be the subset of Mn(F) consisting of all symmetric matrices. Let V{Sn(F),Mn(F)}, a map Φ:VV is said to preserve idempotence if A-λB is idempotent if and only if Φ(A)-λΦ(B) is idempotent for any A,BV and λF. It is shown that: when the characteristic of F is not 2, |F|>3 and n4, Φ:Sn(F)→Sn(F) is a map preserving idempotence if and only if there exists an invertible matrix PMn(F) such that Φ(A)=PAP-1 for every ASn(F) and PtP=aIn for some nonzero scalar a in F.  相似文献   

8.
LetSβ{z : |Im z|<β}. For 2π-periodic functions which are analytic inSβwithp-integrable boundary values, we construct an optimal method of recovery off′(ξ), ξSβ, using information about the valuesf(x1), mldr;, f(xn), xj[0, 2π).  相似文献   

9.
Let G be a graph. For u,vV(G) with distG(u,v)=2, denote JG(u,v)={wNG(u)∩NG(v)|NG(w)NG(u)NG(v){u,v}}. A graph G is called quasi claw-free if JG(u,v)≠ for any u,vV(G) with distG(u,v)=2. In 1986, Thomassen conjectured that every 4-connected line graph is hamiltonian. In this paper we show that every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.  相似文献   

10.
This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω, u = 0, x ∈ (δ)Ω, where Ω (∩) Rn is a smooth bounded convex domain. By using the method of appropriate barrier function combined with the maximum principle, authors obtain a sharp lower bound of the difference of the first two eigenvalues for the Dirichlet eigenvalue problem. This study improves the result of S.T.Yau et al.  相似文献   

11.
Lan Xu  Baoyindureng Wu   《Discrete Mathematics》2008,308(22):5144-5148
The transformation graph G-+- of a graph G is the graph with vertex set V(G)E(G), in which two vertices u and v are joined by an edge if one of the following conditions holds: (i) u,vV(G) and they are not adjacent in G, (ii) u,vE(G) and they are adjacent in G, (iii) one of u and v is in V(G) while the other is in E(G), and they are not incident in G. In this paper, for any graph G, we determine the connectivity and the independence number of G-+-. Furthermore, for a graph G of order n4, we show that G-+- is hamiltonian if and only if G is not isomorphic to any graph in {2K1+K2,K1+K3}{K1,n-1,K1,n-1+e,K1,n-2+K1}.  相似文献   

12.
Let d≥3. Let H be a d+1-dimensional vector space over GF(2) and {e0,…,ed} be a specified basis of H. We define Supp(t){et1,…,etl}, a subset of a specified base for a non-zero vector t=et1++etl of H, and Supp(0)0/. We also define J(t)Supp(t) if |Supp(t)| is odd, and J(t)Supp(t){0} if |Supp(t)| is even.For s,tH, let {a(s,t)} be elements of H(HH) which satisfy the following conditions: (1) a(s,s)=(0,0), (2) a(s,t)=a(t,s), (3) a(s,t)≠(0,0) if st, (4) a(s,t)=a(s,t) if and only if {s,t}={s,t}, (5) {a(s,t)|tH} is a vector space over GF(2), (6) {a(s,t)|s,tH} generate H(HH). Then, it is known that S{X(s)|sH}, where X(s){a(s,t)|tH{s}}, is a dual hyperoval in PG(d(d+3)/2,2)=(H(HH)){(0,0)}.In this note, we assume that, for s,tH, there exists some xs,t in GF(2) such that a(s,t) satisfies the following equation: Then, we prove that the dual hyperoval constructed by {a(s,t)} is isomorphic to either the Huybrechts’ dual hyperoval, or the Buratti and Del Fra’s dual hyperoval.  相似文献   

13.
We consider the problem of characterizing those functions that sequentially take on given mean values and whose rth derivatives have minimal Lp-norm for p(1, ∞].  相似文献   

14.
A norm N on an algebra A is called quadrative if N(x2) ≤ N(x)2 for all x A, and strongly stable if N(xk) ≤ N(x)k for all x A and all k = 2, 3, 4…. Our main purpose in this note is to show that not all quadrative norms are strongly stable.  相似文献   

15.
The present paper shows that the algebra generated by {C|  Aut(Bn)} is cyclic on H2(Bn), and any nonconstant function f  H2(Bn) is a cyclic vector of . In addition, the hypercyclic and cyclic composition operators will be discussed.  相似文献   

16.
For α[1,2) we consider operators of the form
and for α(0,1) we consider the same operator but where the f term is omitted. We prove, under appropriate conditions on A(x,h), that any solution u to will be in Cα+β if fCβ.  相似文献   

17.
Given a graph G=(V,E) with strictly positive integer weights ωi on the vertices iV, a k-interval coloring of G is a function I that assigns an interval I(i){1,…,k} of ωi consecutive integers (called colors) to each vertex iV. If two adjacent vertices x and y have common colors, i.e. I(i)∩I(j)≠0/ for an edge [i,j] in G, then the edge [i,j] is said conflicting. A k-interval coloring without conflicting edges is said legal. The interval coloring problem (ICP) is to determine the smallest integer k, called interval chromatic number of G and denoted χint(G), such that there exists a legal k-interval coloring of G. For a fixed integer k, the k-interval graph coloring problem (k-ICP) is to determine a k-interval coloring of G with a minimum number of conflicting edges. The ICP and k-ICP generalize classical vertex coloring problems where a single color has to be assigned to each vertex (i.e., ωi=1 for all vertices iV).Two k-interval colorings I1 and I2 are said equivalent if there is a permutation π of the integers 1,…,k such that I1(i) if and only if π()I2(i) for all vertices iV. As for classical vertex coloring, the efficiency of algorithms that solve the ICP or the k-ICP can be increased by avoiding considering equivalent k-interval colorings, assuming that they can be identified very quickly. To this purpose, we define and prove a necessary and sufficient condition for the equivalence of two k-interval colorings. We then show how a simple tabu search algorithm for the k-ICP can possibly be improved by forbidding the visit of equivalent solutions.  相似文献   

18.
Let 1<p<∞, and k,m be positive integers such that 0(k−2m)pn. Suppose ΩRn is an open set, and Δ is the Laplacian operator. We will show that there is a sequence of positive constants cj such that for every f in the Sobolev space Wk,p(Ω), for all xΩ except on a set whose Bessel capacity Bk−2m,p is zero.  相似文献   

19.
A Gabor system is a set of time-frequency shifts S(g, Λ) ={e2 π ibxg(xa)}(a, b) Λ of a function g L2(Rd). We prove that if a finite union of Gabor systems k = 1rS(gk, Λk) forms a frame for L2(Rd) then the lower and upper Beurling densities of Λ = k = 1r Λk satisfy D(Λ) ≥ 1 and D + (Λ) < ∞. This extends recent work of Ramanathan and Steger. Additionally, we prove the conjecture that no collection k = 1r{gk(xa)}a Γk of pure translates can form a frame for L2(Rd).  相似文献   

20.
For fLp( n), with 1p<∞, >0 and x n we denote by T(f)(x) the set of every best constant approximant to f in the ball B(x). In this paper we extend the operators Tp to the space Lp−1( n)+L( n), where L0 is the set of every measurable functions finite almost everywhere. Moreover we consider the maximal operators associated to the operators Tp and we prove maximal inequalities for them. As a consequence of these inequalities we obtain a generalization of Lebesgue's Differentiation Theorem.  相似文献   

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

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