首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 581 毫秒
1.
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 → ∞.  相似文献   

2.
Let ρ21,…,ρ2p be the squares of the population canonical correlation coefficients from a normal distribution. This paper is concerned with the estimation of the parameters δ1,…,δp, where δi = ρ2i(1 ? ρ2i), i = 1,…,p, in a decision theoretic way. The approach taken is to estimate a parameter matrix Δ whose eigenvalues are δ1,…,δp, given a random matrix F whose eigenvalues have the same distribution as r2i(1 ? r2i), i = 1,…,p, where r1,…,rp are the sample canonical correlation coefficients.  相似文献   

3.
Let Xj = (X1j ,…, Xpj), j = 1,…, n be n independent random vectors. For x = (x1 ,…, xp) in Rp and for α in [0, 1], let Fj1(x) = αI(X1j < x1 ,…, Xpj < xp) + (1 ? α) I(X1jx1 ,…, Xpjxp), where I(A) is the indicator random variable of the event A. Let Fj(x) = E(Fj1(x)) and Dn = supx, α max1 ≤ Nn0n(Fj1(x) ? Fj(x))|. It is shown that P[DnL] < 4pL exp{?2(L2n?1 ? 1)} for each positive integer n and for all L2n; and, as n → ∞, Dn = 0((nlogn)12) with probability one.  相似文献   

4.
For a sequence A = {Ak} of finite subsets of N we introduce: δ(A) = infm?nA(m)2n, d(A) = lim infn→∞ A(n)2n, where A(m) is the number of subsets Ak ? {1, 2, …, m}.The collection of all subsets of {1, …, n} together with the operation a ∪ b, (a ∩ b), (a 1 b = a ∪ b ? a ∩ b) constitutes a finite semi-group N (semi-group N) (group N1). For N, N we prove analogues of the Erdös-Landau theorem: δ(A+B) ? δ(A)(1+(2λ)?1(1?δ(A>))), where B is a base of N of the average order λ. We prove for N, N, N1 analogues of Schnirelmann's theorem (that δ(A) + δ(B) > 1 implies δ(A + B) = 1) and the inequalities λ ? 2h, where h is the order of the base.We introduce the concept of divisibility of subsets: a|b if b is a continuation of a. We prove an analog of the Davenport-Erdös theorem: if d(A) > 0, then there exists an infinite sequence {Akr}, where Akr | Akr+1 for r = 1, 2, …. In Section 6 we consider for N∪, N∩, N1 analogues of Rohrbach inequality: 2n ? g(n) ? 2n, where g(n) = min k over the subsets {a1 < … < ak} ? {0, 1, 2, …, n}, such that every m? {0, 1, 2, …, n} can be expressed as m = ai + aj.Pour une série A = {Ak} de sous-ensembles finis de N on introduit les densités: δ(A) = infm?nA(m)2m, d(A) = lim infn→∞ A(n)2nA(m) est le nombre d'ensembles Ak ? {1, 2, …, m}. L'ensemble de toutes les parties de {1, 2, …, n} devient, pour les opérations a ∪ b, a ∩ b, a 1 b = a ∪ b ? a ∩ b, un semi-groupe fini N, N ou un groupe N1 respectivement. Pour N, N on démontre l'analogue du théorème de Erdös-Landau: δ(A + B) ? δ(A)(1 + (2λ)?1(1?δ(A))), où B est une base de N d'ordre moyen λ. On démontre pour N, N, N1 l'analogue du théorème de Schnirelmann (si δ(A) + δ(B) > 1, alors δ(A + B) = 1) et les inégalités λ ? 2h, où h est l'ordre de base. On introduit le rapport de divisibilité des enembles: a|b, si b est une continuation de a. On démontre l'analogue du théorème de Davenport-Erdös: si d(A) > 0, alors il existe une sous-série infinie {Akr}, où Akr|Akr+1, pour r = 1, 2, … . Dans le Paragraphe 6 on envisage pour N, N, N1 les analogues de l'inégalité de Rohrbach: 2n ? g(n) ? 2n, où g(n) = min k pour les ensembles {a1 < … < ak} ? {0, 1, 2, …, n} tels que pour tout m? {0, 1, 2, …, n} on a m = ai + aj.  相似文献   

5.
Let Nm(x) be the number of arithmetic progressions that consist of m terms, all primes and not larger than x, and set Fm(x) = Cmx2logmx (Cm explicitly given). It is shown that Hardy and Littlewood's prime k-tuple conjecture implies that Nm(x) = Fm(x){1 + Σj=1Najlog?jx + O((log x)?N?1)}, (here the bracket represents an asymptotic series with explicitly computable coefficients). This formula holds rather trivially for m = 1 and m = 2. It is proved here for m = 3, by the Vinogradov version of the Hardy-Ramanujan-Littlewood circle method.  相似文献   

6.
In this paper, the problem of phase reconstruction from magnitude of multidimensional band-limited functions is considered. It is shown that any irreducible band-limited function f(z1…,zn), zi ? C, i=1, …, n, is uniquely determined from the magnitude of f(x1…,xn): | f(x1…,xn)|, xi ? R, i=1,…, n, except for (1) linear shifts: i(α1z1+…+αn2n+β), β, αi?R, i=1,…, n; and (2) conjugation: f1(z11,…,zn1).  相似文献   

7.
A sufficient condition for scalar irreducibility of a representation of a group on a topological vector space of the form {? ∈ C(R)∣p(?)? = 0 for j=1,…,r} where p1,…,pr are polynomials is given. Applications include the differential operators that are invariant under the Cartan motion group of a symmetric space and the Laplace operator.  相似文献   

8.
We obtain, for a large class of measures μ, general inequalities of the form ∫Rn|u|p A(log1|u|) dμ ? K(6u : Wm,p(Rn,dμ)6p + 6 u 6p A(log1 6 u 6)), where 6u6 = 6 u: Lp(Rn,dμ)6p, log1 t = max{1, log t}, and the function A depends in an appropriate way on μ. Our results extend similar results obtained by Rosen for the case p = 2, A(t) = ts. We also investigate some implications of these inequalities for the imbedding of Sobolev spaces into Orlicz spaces.  相似文献   

9.
The polynomial functions f1, f2,…, fm are found to have highest common factor h for a set of values of the variables x1, x2,…,xm whose asymptotic density is
1hnd∣hμ(d)Πml = 1 ?(f1, dh)dmΠp∣h1?Πml = 1?(f1, p)pm
For the special case f1(x) = f2(x) = … = fm(x) = x and h = 1 the above formula reduces to Π?(1 ? 1pm) = 1ζ(m), the density if m-tuples with highest common factor 1. Necessary and sufficient conditions on the polynomials f1, f2,…, fm for the asymptotic density to be zero are found. In particular it is shown that either the polynomials may never have highest common factor h or else h is the highest common factor infinitely often and in fact with positive density.  相似文献   

10.
Let F be a Sperner family of subsets of {1,…,m}. Bollobás showed that if A ∈ F ? A = {1,…,m}βA ∈ F, and if the parameters of F are p0,…,pm then
i=0[m2Pim?1i?1 + i=[m2]+1mPim?1m?i?1 ? 2
Here we generalize this result and prove some analogues of it. A corollary of Bollobás' result is that |F| ? 2([m2]?1m?1). Purdy proved that if A ∈ F ? A ? F then |F| ? ([m2]+1m), which implies Bollobás' corollary. We also show that Purdy's result may be deduced from Bollobás' by a short argument. Finally, we give a canonical form for Sperner families which are also pairwise intersecting.  相似文献   

11.
Real constant coefficient nth order elliptic operators, Q, which generate strongly continuous semigroups on L2(Rk) are analyzed in terms of the elementary generator,
A = (?n)(n2 ? 1)(n!)?1kj = 1?n?xjn
, for n even. Integral operators are defined using the fundamental solutions pn(x, t) to ut = Au and using real polynomials ql,…, qk on Rm by the formula, for q = (ql,…, qk),
(F(t)?)(x) = ∫
Rm
?(x + q(z)) Pn(z, t)dz
. It is determined when, strongly on L2(Rk),
etQ = limj → ∞ Ftjj
. If n = 2 or k = 1, this can always be done. Otherwise the symbol of Q must have a special form.  相似文献   

12.
We suppose that K is a countable index set and that Λ = {λk¦ k ? K} is a sequence of distinct complex numbers such that E(Λ) = {eλkt¦ λk ? Λ} forms a Riesz (strong) basis for L2[a, b], a < b. Let Σ = {σ1, σ2,…, σm} consist of m complex numbers not in Λ. Then, with p(λ) = Πk = 1m (λ ? σk), E(Σ ∪ Λ) = {eσ1t…, eσmt} ∪ {eλktp(λk)¦ k ? K} forms a Riesz (strong) bas Sobolev space Hm[a, b]. If we take σ1, σ2,…, σm to be complex numbers already in Λ, then, defining p(λ) as before, E(Λ ? Σ) = {p(λk) eλkt¦ k ? K, λk ≠ σj = 1,…, m} forms a Riesz (strong) basis for the space H?m[a, b]. We also discuss the extension of these results to “generalized exponentials” tneλkt.  相似文献   

13.
The following estimate of the pth derivative of a probability density function is examined: Σk = 0Na?khk(x), where hk is the kth Hermite function and a?k = ((?1)pn)Σi = 1nhk(p)(Xi) is calculated from a sequence X1,…, Xn of independent random variables having the common unknown density. If the density has r derivatives the integrated square error converges to zero in the mean and almost completely as rapidly as O(n?α) and O(n?α log n), respectively, where α = 2(r ? p)(2r + 1). Rates for the uniform convergence both in the mean square and almost complete are also given. For any finite interval they are O(n?β) and O(n2log n), respectively, where β = (2(r ? p) ? 1)(2r + 1).  相似文献   

14.
Let G be a group and g1,…, gt a set of generators. There are approximately (2t ? 1)n reduced words in g1,…, gt, of length ?n. Let \?ggn be the number of those which represent 1G. We show that γ = limn → ∞(\?ggn)1n exists. Clearly 1 ? γ ? 2t ? 1. η = (log γ)(log(2t ? 1)) is the cogrowth. 0 ? η ? 1. In fact η ∈ {0} ∪ (12, 1¦. The entropic dimension of G is shown to be 1 ? η. It is then proved that d(G) = 1 if and only if G is free on g1,…, gt and d(G) = 0 if and only if G is amenable.  相似文献   

15.
The message m = {m(t)} is a Gaussian process that is to be transmitted through the white Gaussian channel with feedback: Y(t) = ∫0tF(s, Y0s, m)ds + W(t). Under the average power constraint, E[F2(s, Y0s, m)] ≤ P0, we construct causally the optimal coding, in the sense that the mutual information It(m, Y) between the message m and the channel output Y (up to t) is maximized. The optimal coding is presented by Y(t) = ∫0t A(s)[m(s) ? m?(s)] ds + W(t), where m?(s) = E[m(s) ¦ Y(u), 0 ≤ u ≤ s] and A(s) is a positive function such that A2(s) E |m(s) ? m?(s)|2 = P0.  相似文献   

16.
In this paper we are concerned with positive solutions of the doubly nonlinear parabolic equation ut=div(um−1|∇u|p−2u)+Vum+p−2 in a cylinder Ω×(0,T), with initial condition u(·,0)=u0(·)⩾0 and vanishing on the parabolic boundary ∂Ω×(0,T). Here Ω⊂RN (resp. Hn) is a bounded domain with smooth boundary, V∈Lloc1(Ω), m∈R, 1<p<N and m+p−2>0. The critical exponents q1 are found and the nonexistence results are proved for q1⩽m+p<3.  相似文献   

17.
18.
About spaces NR (see [2, Exercise 5I]), the following are proved: (1) dim N∪R = dim β(N∪R)?N∪R,(2)if|β(N∪R)?N∪R|<2?o, then no real-valued continuous fu ction on NR is onto (and hence, dim N∪R=0), (3) any compact metric space without isolated points is homeomorphic to some β(N∪R)?N∪R and (4)there are spaces X,X1 and X2 of the form NR such that X=X1X2,X2andX2 are zero sets of X, and dim X=n, dimX1=dimX2=0, where n=1,2,… or ∞.  相似文献   

19.
Given the data (xi, yi), i=1, 2, …, n, the problem is to find the values of the linear and nonlinear parameters â and b? which minimize the nonlinear functional |F(b)a?y|22 over a ? Rp, b ? Rq, where F ? Rn×p is a variable matrix and assumed to be of full rank, and y ? Rn is a constant vector.In this paper, we present a method for solving this problem by imbedding it into a one-parameter family of problems and by following its solution path using a predictor-corrector algorithm. In the course of iterations, the original problem containing p+q+1 variables is transformed into a problem with q+1 nonlinear variables by taking the separable structure of the problem into account. By doing so, the method reduces to solving a series of equations of smaller size and a considerable saving in the storage is obtained.Results of numerical experiments are reported to demonstrate the effectiveness of the proposed method.  相似文献   

20.
For nonlinear retarded differential equations y2n(t)?i=1mfi(t,y(t),y(gi(t)))=0 and yn(t)?i=1mPi(t)Fi(y(gi(t)))=h(t), the sufficient conditions are given on fi, pi, Fi, and h under which every bounded nonoscillatory solution of (1) or (7) tends to zero as t → ∞.  相似文献   

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

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