首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this Note we give a generalization of Hardy's theorem for the Dunkl transform FD on Rd. More precisely, for all a>0, b>0 and p,q∈[1,+∞], we determine the measurable functions f such that ea||x||2f∈Lkp(Rd) and eb||y||2FD(f)∈Lkq(Rd), where Lkp(Rd) are the Lp spaces associated with the Dunkl transform. To cite this article: L. Gallardo, K. Trimèche, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 849–854.  相似文献   

2.
3.
For s = σ + it, σ > 1, and integer k ? 1ζk(s) = ∑dk(n)n3. In a previous paper, Ω results for ζ(c + it), 12 ? c ? 1, where obtained in an elementary way by choosing N = N(k, c) so that the size of the single term dk(N) gave Ω results slightly better than existing ones. Here the method will be shown to give the same results for Re ζ(c + it).  相似文献   

4.
Let H = ?Δ + V, where the potential V is spherically symmetric and can be decomposed as a sum of a short-range and a long-range term, V(r) = VS(r) + VL. Let λ = lim supr→∞VL(r) < ∞ (we allow λ = ? ∞) and set λ+ = max(λ, 0). Assume that for some r0, VL(r) ?C2k(r0, ∞) and that there exists δ > 0 such that (ddr)jVL(r) · (λ+ ? VL(r) + 1)?1 = O(r?jδ), j = 1,…, 2k, as r → ∞. Assume further that 1(dr¦ VL(r)¦12) = ∞ and that 2 > 1. It is shown that: (a) The restriction of H to C(Rn) is essentially self-adjoint, (b) The essential spectrum of H contains the closure of (λ, ∞). (c) The part of H over (λ, ∞) is absolutely continuous.  相似文献   

5.
Let {Xt, t ≥ 0} be Brownian motion in Rd (d ≥ 1). Let D be a bounded domain in Rd with C2 boundary, ?D, and let q be a continuous (if d = 1), Hölder continuous (if d ≥ 2) function in D?. If the Feynman-Kac “gauge” Ex{exp(∝0τDq(Xt)dt)1A(XτD)}, where τD is the first exit time from D, is finite for some non-empty open set A on ?D and some x?D, then for any ? ? C0(?D), φ(x) = Ex{exp(∝0τDq(Xt)dt)?(XτD)} is the unique solution in C2(D) ∩ C0(D?) of the Schrödinger boundary value problem (12Δ + q)φ = 0 in D, φ = ? on ?D.  相似文献   

6.
Let V be a set of n points in Rk. Let d(V) denote the diameter of V, and l(V) denote the length of the shortest circuit which passes through all the points of V. (Such a circuit is an “optimal TSP circuit”.) lk(n) are the extremal values of l(V) defined by lk(n)=max{l(V)|VVnk}, where Vnk={V|V?Rk,|V|=n, d(V)=1}. A set VVnk is “longest” if l(V)=lk(n). In this paper, first some geometrical properties of longest sets in R2 are studied which are used to obtain l2(n) for small n′s, and then asymptotic bounds on lk(n) are derived. Let δ(V) denote the minimal distance between a pair of points in V, and let: δk(n)=max{δ(V)|VVnk}. It is easily observed that δk(n)=O(n?1k). Hence, ck=lim supn→∞δk(n)n1k exists. It is shown that for all n, ckn?1k≤δk(n), and hence, for all n, lk(n)≥ ckn1?1k. For k=2, this implies that l2(n)≥(π212)14n12, which generalizes an observation of Fejes-Toth that limn→∞l2(n)n?12≥(π212)14. It is also shown that lk(n) ≤ [(3?√3)k(k?1)]nδk(n) + o(n1?1k) ≤ [(3?√3)k(k?1)]n1?1k + o(n1?1k). The above upper bound is used to improve related results on longest sets in k-dimensional unit cubes obtained by Few (Mathematika2 (1955), 141–144) for almost all k′s. For k=2, Few's technique is used to show that l2(n)≤(πn2)12 + O(1).  相似文献   

7.
Let C be a convex set in Rn. For each y?C, the cone of C at y, denoted by cone(y, C), is the cone {α(x ? y): α ? 0 and x?C}. If K is a cone in Rn, we shall denote by K1 its dual cone and by F(K) the lattice of faces of K. Then the duality operator of K is the mapping dK: F(K) → F(K1) given by dK(F) = (span F) ∩ K1. Properties of the duality operator dK of a closed, pointed, full cone K have been studied before. In this paper, we study dK for a general cone K, especially in relation to dcone(y, K), where y?K. Our main result says that, for any closed cone K in Rn, the duality operator dK is injective (surjective) if and only if the duality operator dcone(y, K) is injective (surjective) for each vector y?K ~ [K ∩ (? K)]. In the last part of the paper, we obtain some partial results on the problem of constructing a compact convex set C, which contains the zero vector, such that cone (0, C) is equal to a given cone.  相似文献   

8.
Let G be a semisimple noncompact Lie group with finite center and let K be a maximal compact subgroup. Then W. H. Barker has shown that if T is a positive definite distribution on G, then T extends to Harish-Chandra's Schwartz space C1(G). We show that the corresponding property is no longer true for the space of double cosets K\GK. If G is of real-rank 1, we construct liner functionals Tp ? (Cc(K\GK))′ for each p, 0 < p ? 2, such that Tp(f 1 f1) ? 0, ?f ? Cc(K\GK) but Tp does not extend to a continuous functional on Cp(K\GK). In particular, if p ? 1, Tv does not extend to a continuous functional on C1(K\GK). We use this to answer a question (in the negative) raised by Barker whether for a K-bi-invariant distribution T on G to be positive definite it is enough to verify that T(f 1 f1) ? 0, ?f ? Cc(K\GK). The main tool used is a theorem of Trombi-Varadarajan.  相似文献   

9.
Let Πk(t) = ∫t(x?t)dP1k(x), where P is a distribution with P(0)=0. Then Πk(t)k is a non-decreasing function of k, and Πk(kt)k is a non-increasing function of k.  相似文献   

10.
In two party elections with popular vote ratio pq, 12≤p=1 ?q, a theoretical model suggests replacing the so-called MacMahon cube law approximation (pq)3, for the ratio PQ of candidates elected, by the ratio ?k(p)?k(q) of the two half sums in the binomial expansion of (p+q)2k+1 for some k. This ratio is nearly (pq)3 when k = 6. The success probability gk(p)=(pa(pa+qa) for the power law (pq)a?PQ is shown to so closely approximate ?k(p)=Σ0k(r2k+1)p2k+1?rqr, if we choose a = ak=(2k+1)!4kk!k!, that 1≤?k(p)gk(p)≤1.01884086 for k≥1 if12≤p≤1. Computationally, we avoid large binomial coefficients in computing ?k(p) for k>22 by expressing 2?k(p)?1 as the sum (p?q) Σ0k(4pq)sas(2s+1), whose terms decrease by the factors (4pq)(1?12s). Setting K = 4k+3, we compute ak for the large k using a continued fraction πak2=K+12(2K+32(2K+52(2K+…))) derived from the ratio of π to the finite Wallis product approximation.  相似文献   

11.
Let k be Z[12], Q or R, and set A = k[x,y](x2 + y2 ? 1). We compute K2(A) and K3(A). Our method is to construct a map ? : K1(k[i])→K1 + 1(A) and compare this to a localization sequence.We give three applications. We show that ? accounts for the primitive elements in K2(A), and compare our results to computations of Bloch [1] for group schemes. Secondly, we consider the problem of basepoint independence, and indicate the interplay of geometry upon the K-theory of affine schemes obtained by glueing points of Spec(A). Third, we can iterate the construction to compute the K-theory of the torus ring A ?kA.  相似文献   

12.
Let (X, A) be a measurable space, Θ ? R an open interval and PΩA, Ω ? Θ, a family of probability measures fulfilling certain regularity conditions. Let Ωn be the maximum likelihood estimate for the sample size n. Let λ be a prior distribution on Θ and let Rn,x be the posterior distribution for the sample size n given x ? Xn. L: Θ × Θ → R denotes a loss function fulfilling certain regularity conditions and Tn denotes the Bayes estimate relative to λ and L for the sample size n. It is proved that for every compact K ? Θ there exists cK ≥ 0 such that
suptheta;∈KPtheta;nh{x∈Xn∥ Tn(x) ? ?nx|? cK(log n)n?} = o(n?12).
This theorem improves results of Bickel and Yahav [3], and Ibragimov and Has'minskii [4], as far as the speed of convergence is concerned.  相似文献   

13.
Let H = ?Δ + V, where the potential V is spherically symmetric and can be decomposed as a sum of a short-range and a long-range term, V(r) = VS(r) + VL(r). Assume that for some r0, VL(r) ?C2k(r0, ∞) and that there exist μ > 0, δ > 0, such that (ddr)jVL(r) = O(r?μ?jδ) as r → ∞, 1 ? j ? 2k. Assume further that min(2, (2k ? 1)δ + μ) > 1. Under this weak decay condition on VL(r) it is shown in this paper that the positive spectrum of H is absolutely continuous and that the absolutely continuous part of H is unitarily equivalent to ?Δ, provided that the singularity of V at 0 is properly restricted. In particular, some oscillation of VL(r) at infinity is allowed.  相似文献   

14.
Let Fm×n (m?n) denote the linear space of all m × n complex or real matrices according as F=C or R. Let c=(c1,…,cm)≠0 be such that c1???cm?0. The c-spectral norm of a matrix A?Fm×n is the quantity
6A6ci=Imciσi(A)
. where σ1(A)???σm(A) are the singular values of A. Let d=(d1,…,dm)≠0, where d1???dm?0. We consider the linear isometries between the normed spaces (Fn,∥·∥c) and (Fn,∥·∥d), and prove that they are dual transformations of the linear operators which map L(d) onto L(c), where
L(c)= {X?Fm×n:X has singular values c1,…,cm}
.  相似文献   

15.
Let k and r be fixed integers such that 1 < r < k. Any positive integer n of the form n = akb, where b is r-free, is called a (k, r)-integer. In this paper we prove that if Qk,r(x) denotes the number of (k, r)-integers ≤ x, then Qk,r(x) = xζ(k)ζ(r) + Δk,r(x), where Δk,r(x) = O(x1rexp [?Blog35x (log log x)?15]), B being a positive constant depending on r and the O-estimate is uniform in k. On the assumption of the Riemann hypothesis, we improve the above order estimate of Δk,r(x) and prove that
1x1αδk,r(t)dt=0(x1kω(x))or0(x3/(4r+1)ω(x))
, according as k ≤ (4r + 1)3 or k > (4r + 1)3, where ω(x) = exp [B log x(log log x)?1].  相似文献   

16.
The compactness method to weighted spaces is extended to prove the following theorem:Let H2,s1(B1) be the weighted Sobolev space on the unit ball in Rn with norm
6ν612,s=B1 (1rs)|ν|2 dx + ∫B1 (1rs)|Dν|2 dx.
Let n ? 2 ? s < n. Let u? [H2,s1(B1) ∩ L(B1)]N be a solution of the nonlinear elliptic system
B11rs, i,j=1n, h,K=1N AhKij(x,u) DiuhDK dx=0
, ψ ? ¦C01(B1N, where ¦Aijhk¦ ? L, Aijhk are uniformly continuous functions of their arguments and satisfy:
|η|2 = i=1n, j=1Nij|2 ? i,j=1n, 1rs, h,K=1N AhKijηihηik,?η?RNn
. Then there exists an R1, 0 < R1 < 1, and an α, 0 < α < 1, along with a set Ω ? B1 such that (1) Hn ? 2(Ω) = 0, (2) Ω does not contain the origin; Ω does not contain BR1, (3) B1 ? Ω is open, (4) u is Lipα(B1 ? Ω); u is LipαBR1.  相似文献   

17.
Given a set S of positive integers let ZkS(t) denote the number of k-tuples 〈m1, …, mk〉 for which mi ∈ S ? [1, t] and (m1, …, mk) = 1. Also let PkS(n) denote the probability that k integers, chosen at random from S ? [1, n], are relatively prime. It is shown that if P = {p1, …, pr} is a finite set of primes and S = {m : (m, p1pr) = 1}, then ZkS(t) = (td(S))k Πν?P(1 ? 1pk) + O(tk?1) if k ≥ 3 and Z2S(t) = (td(S))2 Πp?P(1 ? 1p2) + O(t log t) where d(S) denotes the natural density of S. From this result it follows immediately that PkS(n) → Πp?P(1 ? 1pk) = (ζ(k))?1 Πp∈P(1 ? 1pk)?1 as n → ∞. This result generalizes an earlier result of the author's where P = ? and S is then the whole set of positive integers. It is also shown that if S = {p1x1prxr : xi = 0, 1, 2,…}, then PkS(n) → 0 as n → ∞.  相似文献   

18.
Let θ(k, p) be the least s such that the congruence x1k + … + xsk ≡ 0(mod p) has a nontrivial solution. Let θ(k) = {max θ(k, p)| p > 1 + 2k}. The purpose of this note is to prove the following conjecture of S. Chowla: θ(k) = O(k12+?).  相似文献   

19.
Let {X(t) : t ∈ R+N} denote the N-parameter Wiener process on R+N = [0, ∞)n. For multiple sequences of certain independent random variables the authors find lower bounds for the distributions of maximum of partial sums of these random variables, and as a consequence a useful upper bound for the yet unknown function P{supt∈DnX(t) ≥ c}, c ≥ 0, is obtained where DN = Πk = 1N [0, Tk]. The latter bound is used to give three different varieties of N-parameter generalization of the classical law of iterated logarithm for the standard Brownian motion process.  相似文献   

20.
Let x?Sn, the symmetric group on n symbols. Let θ? Aut(Sn) and let the automorphim order of x with respect to θ be defined by
γθ(x)=min{k:x xθ xθ2 ? xθk?1=1}
where is the image of x under θ. Let αg? Aut(Sn) denote conjugation by the element g?Sn. Let b(g; s, k : n) ≡ ∥{x ? Sn : kγαg(x)sk}∥ where s and k are positive integers and ab denotes a divides b. Further h(s, k : n) ≡ b(1; s, k : n), where 1 denotes the identity automorphim. If g?Sn let c = f(g, s) denote the number of symbols in g which are in cycles of length not dividing the integer s, and let gs denote the product of all cycles in g whose lengths do not divide s. Then gs moves c symbols. The main results proved are: (1) recursion: if n ? c + 1 and t = n ? c ? 1 then b(g; s, 1:n)=∑is b(g; s, 1:n?1)(ti?1(i?1)! (2) reduction: b(g; s, 1 : c)h(s, 1 : i) = b(g; s, 1 : i + c); (3) distribution: let D(θ, n) ≡ {(k, b) : k?Z+ and b = b(θ; 1, k : n) ≠ 0}; then D(θ, m) = D(φ, m) ∨ m ? N = N(θ, φ) iff θ is conjugate to φ; (4) evaluation: the number of cycles in gss of any given length is smaller than the smallest prime dividing s iff b(gs; s, 1 : c) = 1. If g = (12 … pm)t and skpm then b(g;s,k:pm) {0±1(mod p).  相似文献   

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

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