首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 281 毫秒
1.
Let μ be a measure on ℝn that satisfies the estimate μ(B r(x))≤cr α for allx ∈n and allr ≤ 1 (B r(x) denotes the ball of radius r centered atx. Let ϕ j,k (ɛ) (x)=2 nj2ϕ(ɛ)(2 j x-k) be a wavelet basis forj ∈ ℤ, κ ∈ ℤn, and ∈ ∈E, a finite set, and letP j (T)=Σɛ,k <T j,k (ɛ) j,k (ɛ) denote the associated projection operators at levelj (T is a suitable measure or distribution). IffLs p(dμ) for 1 ≤p ≤ ∞, we show thatP j(f dμ) ∈ Lp(dx) and ||P j (fdμ)||L p(dx)c2 j((n-α)/p′))||f||L p(dμ) for allj ≥ 0. We also obtain estimates for the limsup and liminf of ||P j (fdμ)||L p(dx) under more restrictive hypotheses. Communicated by Guido Weiss  相似文献   

2.
The present paper gives a converse result by showing that there exists a functionfC [−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE n (0) (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E n(f) is the ordinary best polynomial approximation off of degreen.  相似文献   

3.
Let G be a graph of order n with connectivity κ≥3 and let α be the independence number of G. Set σ4(G)= min{∑4 i =1 d(x i ):{x 1,x 2,x 3,x 4} is an independent set of G}. In this paper, we will prove that if σ4(G)≥n+2κ, then there exists a longest cycle C of G such that V(GC) is an independent set of G. Furthermore, if the minimum degree of G is at least α, then G is hamiltonian. Received: July 31, 1998?Final version received: October 4, 2000  相似文献   

4.
Let Ω be an open subset of R d , d≥2, and let x∈Ω. A Jensen measure for x on Ω is a Borel probability measure μ, supported on a compact subset of Ω, such that ∫udμ≤u(x) for every superharmonic function u on Ω. Denote by J x (Ω) the family of Jensen measures for x on Ω. We present two characterizations of ext(J x (Ω)), the set of extreme elements of J x (Ω). The first is in terms of finely harmonic measures, and the second as limits of harmonic measures on decreasing sequences of domains. This allows us to relax the local boundedness condition in a previous result of B. Cole and T. Ransford, Jensen measures and harmonic measures, J. Reine Angew. Math. 541 (2001), 29–53. As an application, we give an improvement of a result by Khabibullin on the question of whether, given a complex sequence {α n } n=1 and a continuous function , there exists an entire function f≢0 satisfying f n )=0 for all n, and |f(z)|≤M(z) for all zC.  相似文献   

5.
Let X(t) be an N parameter generalized Lévy sheet taking values in ℝd with a lower index α, ℜ = {(s, t] = ∏ i=1 N (s i, t i], s i < t i}, E(x, Q) = {tQ: X(t) = x}, Q ∈ ℜ be the level set of X at x and X(Q) = {x: ∃tQ such that X(t) = x} be the image of X on Q. In this paper, the problems of the existence and increment size of the local times for X(t) are studied. In addition, the Hausdorff dimension of E(x, Q) and the upper bound of a uniform dimension for X(Q) are also established.  相似文献   

6.
Let ρ be a triangulation of a polygonal domain D⊂R2 with vertices V={vi:l≤i≤Nv} and RSk(D, ρ)={u∈Ck(D): ≠ T∈ρ, u/T is a rational function}. The purpose of this paper is to study the existence and construction of Cμ-rational spline functions on any triangulation ρ for CAGD. The Hermite problem Hμ(V,U)={find u∈U: Dαu(vi)=Dαf(vi),|α|≤μ} is solved by the generalized wedge function method in rational spline function family, i.e. U=RSμ. this solution needs only the knowledge of partial derivatives of order≤μ at vi. The explicit repesentations of all Cμ-GWF(generalized wedge functions)and the interpolating operator with degree of precision at least 2μ+1 for any triangulation are given.  相似文献   

7.
Let Δ3 be the set of functions three times continuously differentiable on [−1, 1] and such that f″′(x) ≥ 0, x ∈ [−1, 1]. We prove that, for any n ∈ ℕ and r ≥ 5, there exists a function fC r [−1, 1] ⋂ Δ3 [−1, 1] such that ∥f (r) C[−1, 1] ≤ 1 and, for an arbitrary algebraic polynomial P ∈ Δ3 [−1, 1], there exists x such that
| f(x) - P(x) | 3 C?n \uprhonr(x), \left| {f(x) - P(x)} \right| \geq C\sqrt n {{\uprho}}_n^r(x),  相似文献   

8.
Given a (known) function f:[0,1]→(0,1), we consider the problem of simulating a coin with probability of heads f(p) by tossing a coin with unknown heads probability p, as well as a fair coin, N times each, where N may be random. The work of Keane and O’Brien (ACM Trans. Model. Comput. Simul. 4(2):213–219, 1994) implies that such a simulation scheme with the probability ℙ p (N<∞) equal to 1 exists if and only if f is continuous. Nacu and Peres (Ann. Appl. Probab. 15(1A):93–115, 2005) proved that f is real analytic in an open set S⊂(0,1) if and only if such a simulation scheme exists with the probability ℙ p (N>n) decaying exponentially in n for every pS. We prove that for α>0 noninteger, f is in the space C α [0,1] if and only if a simulation scheme as above exists with ℙ p (N>n)≤C(Δ n (p)) α , where \varDelta n(x):=max{?{x(1-x)/n},1/n}\varDelta _{n}(x):=\max\{\sqrt{x(1-x)/n},1/n\}. The key to the proof is a new result in approximation theory: Let B+n\mathcal{B}^{+}_{n} be the cone of univariate polynomials with nonnegative Bernstein coefficients of degree n. We show that a function f:[0,1]→(0,1) is in C α [0,1] if and only if f has a series representation ?n=1Fn\sum_{n=1}^{\infty}F_{n} with Fn ? B+nF_{n}\in \mathcal{B}^{+}_{n} and ∑ k>n F k (x)≤C(Δ n (x)) α for all x∈[0,1] and n≥1. We also provide a counterexample to a theorem stated without proof by Lorentz (Math. Ann. 151:239–251, 1963), who claimed that if some jn ? B+n\varphi_{n}\in\mathcal{B}^{+}_{n} satisfy |f(x)−φ n (x)|≤C(Δ n (x)) α for all x∈[0,1] and n≥1, then fC α [0,1].  相似文献   

9.
Letf(x)=θ1 x 1 k +...+θ s x s k be an additive form with real coefficients, and ∥α∥ = min {|α-u|:uεℤ} denote the distance fromα to the nearest integer. We show that ifθ 1,…,θ s , are algebraic ands = 4k then there are integersx 1,…,x s , satisfying l ≤x 1,≤ N and ∥f(x)∥ ≤ N E , withE = − 1 + 2/e. Whens = λk, 1 ≤λ ≤ 2k, the exponentE may be replaced byλE/4, and if we drop the condition thatθ 1,…,θ s , be algebraic then the result holds for almost all values of θεℝ s . Whenk ≥ 6 is small a better exponent is obtained using Heath-Brown’s version of Weyl’s estimate.  相似文献   

10.
LetP be the convex hull of perfect matchings of a graphG=(V, E). The dominant ofP is {yR E yx for somexP}. A theorem of Fulkerson implies that, ifG is bipartite, then the dominant ofP can be described by linear inequalities having {0, 1}-valued coefficients. However, this is far from true in general. Here it is proved that, for every positive integern, there exists a graph for which the dominant has an essential valid inequality whose coefficient-set includes the firstn positive integers. A similar result holds for the submissive ofP, {yR E ∶0≤yx for somexP}. Research partially supported by a grant from NSERC of Canada.  相似文献   

11.
We study the Cauchy problem for the nonlinear dissipative equations (0.1) uo∂u-αδu + Β|u|2/n u = 0,x ∃ Rn,t } 0,u(0,x) = u0(x),x ∃ Rn, where α,Β ∃ C, ℜα 0. We are interested in the dissipative case ℜα 0, and ℜδ(α,Β) 0, θ = |∫ u0(x)dx| ⊋ 0, where δ(α, Β) = ##|α|n-1nn/2 / ((n + 1)|α|2 + α2 n/2. Furthermore, we assume that the initial data u0 ∃ Lp are such that (1 + |x|)αu0 ∃ L1, with sufficiently small norm ∃ = (1 + |x|)α u0 1 + u0 p, wherep 1, α ∃ (0,1). Then there exists a unique solution of the Cauchy problem (0.1)u(t, x) ∃ C ((0, ∞); L) ∩ C ([0, ∞); L1 ∩ Lp) satisfying the time decay estimates for allt0 u(t)|| Cɛt-n/2(1 + η log 〈t〉)-n/2, if hg = θ2/n 2π ℜδ(α, Β) 0; u(t)|| Cɛt-n/2(1 + Μ log 〈t〉)-n/4, if η = 0 and Μ = θ4/n 4π)2 (ℑδ(α, Β))2 ℜ((1 + 1/n) υ1-1 υ2) 0; and u(t)|| Cɛt-n/2(1 + κ log 〈t〉)-n/6, if η = 0, Μ = 0, κ 0, where υl,l = 1,2 are defined in (1.2), κ is a positive constant defined in (2.31).  相似文献   

12.
LetG denote the set of decreasingG: ℝ→ℝ withGэ1 on ]−∞,0], and ƒ 0 G(t)dt⩽1. LetX be a compact metric space, andT: X→X a continuous map. Let μ denone aT-invariant ergodic probability measure onX, and assume (X, T, μ) to be aperiodic. LetU⊂X be such that μ(U)>0. Let τ U (x)=inf{k⩾1:T k xεU}, and defineG U (t)=1/u(U)u({xεU:u(UU(x)>t),tεℝ We prove that for μ-a.e.x∈X, there exists a sequence (U n ) n≥1 of neighbourhoods ofx such that {x}=∩ n U n , and for anyGG, there exists a subsequence (n k ) k≥1 withG U n k U weakly. We also construct a uniquely ergodic Toeplitz flowO(x ,S, μ), the orbit closure of a Toeplitz sequencex , such that the above conclusion still holds, with moreover the requirement that eachU n be a cylinder set. In memory of Anzelm Iwanik  相似文献   

13.
Summary Let {p(x, θ): θ∈Θ} be a family of densities where θ=(θ12), being θ1 ∈ Θ1 ak-dimensional parameter of interest, θ2 ∈ Θ2 a nuisance parameter and Θ=Θ1×Θ2. To estimate θ1, vector estimating equations g(x,θ1)=(g1(x,θ1),...,gk(x,θ1))=0 are considered. The standardized form of g(x,θ1) is defined as gs=(Eθ(∂g/∂θ′1))−1g. Then, within the classG 1 of unbiased equations (i.e. satisfying Eθ(g)=0 (θ∈Θ)), an equationg *=0 is said to be optimum if the covariance matrices ofg s andg s * are such that is non-negative definite for allg∈ G 1 and θ∈Θ. Sufficient conditions for optimality are discussed and, in particular, conditions for the optimality of the maximum conditional likelihood equation are analyzed. Special attention is given to non-regular cases. In addition, measures of the information about θ1 contained in an estimating equation are presented and a Rao-Blackwell theorem is given. CIENES  相似文献   

14.
For a graph G, we define σ2(G) := min{d(u) + d(v)|u, v ≠ ∈ E(G), u ≠ v}. Let k ≥ 1 be an integer and G be a graph of order n ≥ 3k. We prove if σ2(G) ≥ n + k − 1, then for any set of k independent vertices v 1,...,v k , G has k vertex-disjoint cycles C 1,..., C k of length at most four such that v i V(C i ) for all 1 ≤ ik. And show if σ2(G) ≥ n + k − 1, then for any set of k independent vertices v 1,...,v k , G has k vertex-disjoint cycles C 1,..., C k such that v i V(C i ) for all 1 ≤ i ≤ k, V(C 1) ∪...∪ V(C k ) = V(G), and |C i | ≤ 4 for all 1 ≤ i ≤ k − 1. The condition of degree sum σ2(G) ≥ n + k − 1 is sharp. Received: December 20, 2006. Final version received: December 12, 2007.  相似文献   

15.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ () n −ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour number μ(G) of G: n− (n−ω)() n −ω≤μ(G)≤n−α() α. Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002  相似文献   

16.
LetM be a σ-finite von Neumann algebra andα be an action ofR onM. LetH (α) be the associated analytic subalgebra; i.e.H (α)={XM: sp(X) [0, ∞]}. We prove that every σ-weakly closed subalgebra ofM that containsH (α) isH (γ) for some actionγ ofR onM. Also we show that (assumingZ(M)∩M α = Ci)H (α) is a maximal σ-weakly closed subalgebra ofM if and only if eitherH (α)={AM: (I−F)xF=0} for some projectionFM, or sp(α)=Γ(α).  相似文献   

17.
The subgroups E(m,R) ⊗ E(n,R) ≤ HG = GL(mn,R) are studied under the assumption that the ring R is commutative and m, n ≥ 3. The group GL m ⊗GL n is defined by equations, the normalizer of the group E(m,R) ⊗ E(n,R) is calculated, and with each intermediate subgroup H it is associated a uniquely determined lower level (A,B,C), where A,B,C are ideals in R such that mA,A 2BA and nA,A 2CA. The lower level specifies the largest elementary subgroup satisfying the condition E(m, n,R, A,B,C) ≤ H. The standard answer to this problem asserts that H is contained in the normalizer N G (E(m,n,R, A,B,C)). Bibliography: 46 titles.  相似文献   

18.
Suppose that(T t )t>0 is aC 0 semi-group of contractions on a Banach spaceX, such that there exists a vectorxX, ‖x‖=1 verifyingJ −1(Jx)={x}, whereJ is the duality mapping fromX toP(X *). If |<T t x,f>|→1, whent→+∞ for somefX *, ‖f‖≤1 thenx is an eigenvector of the generatorA, associated with a purcly imaginary eigenvalue. Because of Lin's example [L], the hypothesis onxX is the best possible. If the hypothesisJ −1(Jx)={x} is not verified, we can prove that ifJx is a singleton and ifJ −1(Jx) is weakly compact, then if |<T t x, f>|→1, whent→+∞ for somefX *, ‖f‖≤1, there existsyJ −1(Jx) such thaty is an eigenvector of the generatorA, associated with a purely imaginary eigenvalue. We give also a counter-example in the case whereX is one of the spaces ℓ1 orL 1.  相似文献   

19.
 Let G=(I n ,E) be the graph of the n-dimensional cube. Namely, I n ={0,1} n and [x,y]∈E whenever ||xy||1=1. For AI n and xA define h A (x) =#{yI n A|[x,y]∈E}, i.e., the number of vertices adjacent to x outside of A. Talagrand, following Margulis, proves that for every set AI n of size 2 n−1 we have for a universal constant K independent of n. We prove a related lower bound for graphs: Let G=(V,E) be a graph with . Then , where d(x) is the degree of x. Equality occurs for the clique on k vertices. Received: January 7, 2000 RID="*" ID="*" Supported in part by BSF and by the Israeli academy of sciences  相似文献   

20.
Let E be a uniformly convex Banach space and K a nonempty convex closed subset which is also a nonexpansive retract of E. Let T 1, T 2 and T 3: KE be asymptotically nonexpansive mappings with {k n }, {l n } and {j n }. [1, ∞) such that Σ n=1 (k n − 1) < ∞, Σ n=1 (l n − 1) < ∞ and Σ n=1 (j n − 1) < ∞, respectively and F nonempty, where F = {xK: T 1x = T 2x = T 3 x} = x} denotes the common fixed points set of T 1, T 2 and T 3. Let {α n }, {α′ n } and {α″ n } be real sequences in (0, 1) and ≤ {α n }, {α′ n }, {α″ n } ≤ 1 − for all nN and some > 0. Starting from arbitrary x 1K define the sequence {x n } by
(i) If the dual E* of E has the Kadec-Klee property then {x n } converges weakly to a common fixed point pF; (ii) If T satisfies condition (A′) then {x n } converges strongly to a common fixed point pF.   相似文献   

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

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