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

2.
For a > 0 let ψa(x, y) = ΣaΩ(n), the sum taken over all n, 1 ≤ nx such that if p is prime and p|n then a < py. It is shown for u < about (log log xlog log log x) that ψa(x, x1u) ? x(log x)a?1pa(u), where pa(u) solves a delay differential equation much like that for the Dickman function p(u), and the asymptotic behavior of pa(u) is worked out.  相似文献   

3.
If r, k are positive integers, then Tkr(n) denotes the number of k-tuples of positive integers (x1, x2, …, xk) with 1 ≤ xin and (x1, x2, …, xk)r = 1. An explicit formula for Tkr(n) is derived and it is shown that limn→∞Tkr(n)nk = 1ζ(rk).If S = {p1, p2, …, pa} is a finite set of primes, then 〈S〉 = {p1a1p2a2psas; piS and ai ≥ 0 for all i} and Tkr(S, n) denotes the number of k-tuples (x1, x3, …, xk) with 1 ≤ xin and (x1, x2, …, xk)r ∈ 〈S〉. Asymptotic formulas for Tkr(S, n) are derived and it is shown that limn→∞Tkr(S, n)nk = (p1 … pa)rkζ(rk)(p1rk ? 1) … (psrk ? 1).  相似文献   

4.
The system ?x?t = Δx + F(x,y), ?y?t = G(x,y) is investigated, where x and y are scalar functions of time (t ? 0), and n space variables 1,…, ξn), Δx ≡ ∑i = 1n?2xi2, and F and G are nonlinear functions. Under certain hypotheses on F and G it is proved that there exists a unique spherically symmetric solution (x(r),y(r)), where r = (ξ12 + … + ξn2)12, which is bounded for r ? 0 and satisfies x(0) >x0, y(0) > y0, x′(0) = 0, y′(0) = 0, and x′ < 0, y′ > 0, ?r > 0. Thus, (x(r), y(r)) represents a time independent equilibrium solution of the system. Further, the linearization of the system restricted to spherically symmetric solutions, around (x(r), y(r)), has a unique positive eigenvalue. This is in contrast to the case n = 1 (i.e., one space dimension) in which zero is an eigenvalue. The uniqueness of the positive eigenvalue is used in the proof that the spherically symmetric solution described is unique.  相似文献   

5.
It is known that the classical orthogonal polynomials satisfy inequalities of the form Un2(x) ? Un + 1(x) Un ? 1(x) > 0 when x lies in the spectral interval. These are called Turan inequalities. In this paper we will prove a generalized Turan inequality for ultraspherical and Laguerre polynomials. Specifically if Pnλ(x) and Lnα(x) are the ultraspherical and Laguerre polynomials and Fnλ(x) = Pnλ(x)Pnλ(1), Gnα(x) = Lnα(x)Lnα(0), then Fnα(x) Fnβ(x) ? Fn + 1α(x) Fn ? 1β(x) > 0, ? 1 < x < 1, ?12 < α ? β ? α + 1 and Gnα(x) Gnβ(x) ? Gn + 1α(x) Gn ? 1β(x) > 0, x > 0, 0 < α ? β ? α + 1. We also prove the inequality (n + 1) Fnα(x) Fnβ(x) ? nFn + 1α(x) Fn ? 1β(x) > An[Fnα(x)]2, ?1 < x < 1, ?12 < α ? β < α + 1, where An is a positive constant depending on α and β.  相似文献   

6.
For an n × n Hermitean matrix A with eigenvalues λ1, …, λn the eigenvalue-distribution is defined by G(x, A) := 1n · number {λi: λi ? x} for all real x. Let An for n = 1, 2, … be an n × n matrix, whose entries aik are for i, k = 1, …, n independent complex random variables on a probability space (Ω, R, p) with the same distribution Fa. Suppose that all moments E | a | k, k = 1, 2, … are finite, Ea=0 and E | a | 2. Let
M(A)=σ=1s θσPσ(A,A1)
with complex numbers θσ and finite products Pσ of factors A and A1 (= Hermitean conjugate) be a function which assigns to each matrix A an Hermitean matrix M(A). The following limit theorem is proved: There exists a distribution function G0(x) = G1x) + G2(x), where G1 is a step function and G2 is absolutely continuous, such that with probability 1 G(x, M(Ann12)) converges to G0(x) as n → ∞ for all continuity points x of G0. The density g of G2 vanishes outside a finite interval. There are only finitely many jumps of G1. Both, G1 and G2, can explicitly be expressed by means of a certain algebraic function f, which is determined by equations, which can easily be derived from the special form of M(A). This result is analogous to Wigner's semicircle theorem for symmetric random matrices (E. P. Wigner, Random matrices in physics, SIAM Review9 (1967), 1–23). The examples ArA1r, Ar + A1r, ArA1r ± A1rAr, r = 1, 2, …, are discussed in more detail. Some inequalities for random matrices are derived. It turns out that with probability 1 the sharpened form
lim supn→∞i=1ni(n)|2?6An62? 0.8228…
of Schur's inequality for the eigenvalues λi(n) of An holds. Consequently random matrices do not tend to be normal matrices for large n.  相似文献   

7.
Let A(x,ε) be an n×n matrix function holomorphic for |x|?x0, 0<ε?ε0, and possessing, uniformly in x, an asymptotic expansion A(x,ε)?Σr=0Ar(x) εr, as ε→0+. An invertible, holomorphic matrix function P(x,ε) with an asymptotic expansion P(x,ε)?Σr=0Pr(x)εr, as ε→0+, is constructed, such that the transformation y = P(x,ε)z takes the differential equation εhdydx = A(x,ε)y,h a positive integer, into εhdzdx = B(x,ε)z, where B(x,ε) is asymptotically equal, to all orders, to a matrix in a canonical form for holomorphic matrices due to V.I. Arnold.  相似文献   

8.
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 → ∞.  相似文献   

9.
An elementary proof is given of the author's transformation formula for the Lambert series Gp(x) = Σn?1 n?pxn(1?xn) relating Gp(e2πiτ) to Gp(e2πiAτ), where p > 1 is an odd integer and Aτ = (aτ + b)(cτ + d) is a general modular substitution. The method extends Sczech's argument for treating Dedekind's function log η(τ) = πiτ12 ? G1(e2πiτ), and uses Carlitz's formula expressing generalized Dedekind sums in terms of Eulerian functions.  相似文献   

10.
In this paper we study the linked nonlinear multiparameter system
yrn(Xr) + MrYr + s=1k λs(ars(Xr) + Prs) Yr(Xr) = 0, r = l,…, k
, where xr? [ar, br], yr is subject to Sturm-Liouville boundary conditions, and the continuous functions ars satisfy ¦ A ¦ (x) = detars(xr) > 0. Conditions on the polynomial operators Mr, Prs are produced which guarantee a sequence of eigenfunctions for this problem yn(x) = Πr=1kyrn(xr), n ? 1, which form a basis in L2([a, b], ¦ A ¦). Here [a, b] = [a1, b1 × … × [ak, bk].  相似文献   

11.
In “The Slimmest Geometric Lattices” (Trans. Amer. Math. Soc.). Dowling and Wilson showed that if G is a combinatorial geometry of rank r(G) = n, and if X(G) = Σμ(0, x)λr ? r(x) = Σ (?1)r ? kWkλk is the characteristic polynomial of G, then
wk?rk+nr?1k
Thus γ(G) ? 2r ? 1 (n+2), where γ(G) = Σwk. In this paper we sharpen these lower bounds for connected geometries: If G is connected, r(G) ? 3, and n(G) ? 2 ((r, n) ≠ (4,3)), then
wi?ri + nri+1 for i>1; w1?r+nr2 ? 1;
|μ| ? (r? 1)n; and γ ? (2r ? 1 ? 1)(2n + 2). These bounds are all achieved for the parallel connection of an r-point circuit and an (n + 1)point line. If G is any series-parallel network, r(G) = r(G?) = 4, and n(G) = n(G?) = 3 then (w1(G))4t-G ? (w1(G?)) = (8, 20, 18, 7, 1). Further, if β is the Crapo invariant,
β(G)=dX(G)(1),
then β(G) ? max(1, n ? r + 2). This lower bound is achieved by the parallel connection of a line and a maximal size series-parallel network.  相似文献   

12.
Let Z(Sn;?(x)) denote the polynomial obtained from the cycle index of the symmetric group Z(Sn) by replacing each variable si by f(x1). Let f(x) have a Taylor series with radius of convergence ? of the form f(x)=xk + ak+1xk+1 + ak+2xk+2+? with every a1?0. Finally, let 0<x<1 and let x??. We prove that
limn→∞Z(Sn;?(x))xkn = Πi=1k(1?xi)?ak+1
This limit is used to estimate the probability (for n and p both large) that a point chosen at random from a random p-point tree has degree n + 1. These limiting probabilities are independent of p and decrease geometrically in n, contrasting with the labeled limiting probabilities of 1n!e.In order to prove the main theorem, an appealing generalization of the principle of inclusion and exclusion is presented.  相似文献   

13.
The probability measure of X = (x0,…, xr), where x0,…, xr are independent isotropic random points in Rn (1 ≤ rn ? 1) with absolutely continuous distributions is, for a certain class of distributions of X, expressed as a product measure involving as factors the joint probability measure of (ω, ?), the probability measure of p, and the probability measure of Y1 = (y01,…, yr1). Here ω is the r-subspace parallel to the r-flat η determined by X, ? is a unit vector in ω with ‘initial’ point at the origin [ω is the (n ? r)-subspace orthocomplementary to ω], p is the norm of the vector z from the origin to the orthogonal projection of the origin on η, and yi1 = (xi ? z)α(p2), where α is a scale factor determined by p. The probability measure for ω is the unique probability measure on the Grassmann manifold of r-subspaces in Rn invariant under the group of rotations in Rn, while the conditional probability measure of ? given ω is uniform on the boundary of the unit (n ? r)-ball in ω with centre at the origin. The decomposition allows the evaluation of the moments, for a suitable class of distributions of X, of the r-volume of the simplicial convex hull of {x0,…, xr} for 1 ≤ rn.  相似文献   

14.
In 1965, Chowla and Walum conjectured that, Ga,k(x):= Σn ≤ √x na Pk(xn) = O(xa2 + 14 + ε) holds for each ε > 0 and x → ∞, where integers a ≥ 0 and k ≥ 1 are given and Pk is the periodic Bernoulli function of order k. Recently, the authors established this conjecture in case k ≥ 2 and a > 12 with ε = 0 while if a = 12, with a log factor. In this paper, it is proven that the conjecture, in case |a| < 12, k = 2, is true “on average”.  相似文献   

15.
Let Fn(x) be the empirical distribution function based on n independent random variables X1,…,Xn from a common distribution function F(x), and let X = Σi=1nXin be the sample mean. We derive the rate of convergence of Fn(X) to normality (for the regular as well as nonregular cases), a law of iterated logarithm, and an invariance principle for Fn(X).  相似文献   

16.
Let d(n) denote the number of positive integers dividing the positive integer n. We show that as x approaches ∞, #{n ≤ x: d(n) divides n} = (xlog x)(log log x)?1 + 0(1).  相似文献   

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

18.
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).  相似文献   

19.
We compare assumptions used in [4] in order to study the rate of convergence to 0, as us+(F), of d(u)=supx∈[0,s+(F)?u[|Fu(x)?Gγ(x+u?α(u)σ(u))|, where Fu is the survival function of the excesses over u, s+(F)=sup{x,F(x)<1} is the upper end point of the distribution function (d.f.) F and Gγ is the survival function of the Generalized Pareto Distribution, with assumptions used in [2] in order to study the rate of convergence to 0, as n→+∞, of d?n=supx∈R|Fn(x)?Hγ(x?αnσn)|, where Hγ is the d.f. of an extreme value distribution. In each case, an indicator linked to regular variation assumptions had been introduced. We characterize situations where these two indicators coincide, and others where they are different. To cite this article: R. Worms, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 709–712.  相似文献   

20.
For the Favard class Fr in the space C2π of continuous 2π-periodic functions we solve the following problem. Given x∈R and knots x0< x1 < ··· < xv?1., xu? 2π we determine weights xki(0 ?k · n, 0 ? j < r) such that
supf∈Frf(x)?k=0n?1j=0r?1 αkjf(i)(Xk)
is minimal. The optimal weights are unique (except for a trivial case) and we obtain them from a system of periodic polynomial splines ukj(0 ? k < n, 0 ?j< r): αkj = ukj(x). These splines induce an interpolation operator whose degree of approximation with respect to the class Fr is minimal if the knots are equidistant. Finally, we describe an efficient numerical procedure which shows how to compute the interpolation spline in the equidistant case.  相似文献   

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

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