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

2.
It is proved that Wigner's semicircle law for the distribution of eigenvalues of random matrices, which is important in the statistical theory of energy levels of heavy nuclei, possesses the following completely deterministic version. Let An=(aij), 1?i, ?n, be the nth section of an infinite Hermitian matrix, {λ(n)}1?k?n its eigenvalues, and {uk(n)}1?k?n the corresponding (orthonormalized column) eigenvectors. Let v1n=(an1,an2,?,an,n?1), put
Xn(t)=[n(n-1)]-12k=1[(n-1)t]|vn1uf(n-1)|2,0?t?1
(bookeeping function for the length of the projections of the new row v1n of An onto the eigenvectors of the preceding matrix An?1), and let finally
Fn(x)=n-1(number of λk(n)?xn,1?k?n)
(empirical distribution function of the eigenvalues of Ann. Suppose (i) limnannn=0, (ii) limnXn(t)=Ct(0<C<∞,0?t?1). Then
Fn?W(·,C)(n→∞)
,where W is absolutely continuous with (semicircle) density
w(x,C)=(2Cπ)-1(4C-x212for|x|?2C0for|x|?2C
  相似文献   

3.
The condition Σk<xn<x(χ(n) ? z)4Ω(n)n| = o(√logx), where Ω(n) stands for the number of prime factors, counted according to multiplicity, of the positive integer n, is shown to be necessary and sufficient for the integer sequence with characteristic function χ to have divisor density z, i.e., Σd|nχ(d) = (z + o(1)) Σd|n 1 when n → ∞ if one neglects a sequence of asymptotic density zero. Among the applications, the following result, first conjectured by R. R. Hall, is proved: given any positive α, we have, for almost all n's, and uniformly with respect to z in |0, 1|,
card {d:d|n, (log d)α < z (mod 1)}=(z+o(1)) d|n1.
  相似文献   

4.
Let Xi be iidrv's and Sn=X1+X2+…+Xn. When EX21<+∞, by the law of the iterated logarithm (Snn)(n log n)12→0 a.s. for some constants αn. Thus the r.v. Y=supn?1[|Snn|?(δn log n)12]+ is a.s.finite when δ>0. We prove a rate of convergence theorem related to the classical results of Baum and Katz, and apply it to show, without the prior assumption EX21<+∞ that EYh<+∞ if and only if E|X1|2+h[log|X1|]-1<+∞ for 0<h<1 and δ> hE(X1?EX1)2, whereas EYh=+∞ whenever h>0 and 0<δ<hE(X1?EX1)2.  相似文献   

5.
Let Kn= {x ? Rn: (x12 + · +x2n?1)12 ? xn} be the n-dimensional ice cream cone, and let Γ(Kn) be the cone of all matrices in Rnn mapping Kn into itself. We determine the structure of Γ(Kn), and in particular characterize the extreme matrices in Γ(Kn).  相似文献   

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

7.
Explicit and asymptotic solutions are presented to the recurrence M(1) = g(1), M(n + 1) = g(n + 1) + min1 ? t ? n(αM(t) + βM(n + 1 ? t)) for the cases (1) α + β < 1, log2αlog2β is rational, and g(n) = δnI. (2) α + β > 1, min(α, β) > 1, log2αlog2β is rational, and (a) g(n) = δn1, (b) g(n) = 1. The general form of this recurrence was studied extensively by Fredman and Knuth [J. Math. Anal. Appl.48 (1974), 534–559], who showed, without actually solving the recurrence, that in the above cases M(n) = Ω(n1 + 1γ), where γ is defined by α + β = 1, and that limn → ∞M(n)n1 + γ does not exist. Using similar techniques, the recurrence M(1) = g(1), M(n + 1) = g(n + 1) + max1 ? t ? n(αM(t) + βM(n + 1 ? t)) is also investigated for the special case α = β < 1 and g(n) = 1 if n is odd = 0 if n is even.  相似文献   

8.
Let Fn denote the ring of n×n matrices over the finite field F=GF(q) and let A(x)=ANxN+ ?+ A1x+A0?Fn[x]. A function ?:Fn→Fn is called a right polynomial function iff there exists an A(x)?Fn[x] such that ?(B)=ANBN+?+A1B+ A0 for every B?Fn. This paper obtains unique representations for and determines the number of right polynomial functions.  相似文献   

9.
10.
Let {Xn}n≥1 be a sequence of independent and identically distributed random variables. For each integer n ≥ 1 and positive constants r, t, and ?, let Sn = Σj=1nXj and E{N(r, t, ?)} = Σn=1 nr?2P{|Sn| > ?nrt}. In this paper, we prove that (1) lim?→0+?α(r?1)E{N(r, t, ?)} = K(r, t) if E(X1) = 0, Var(X1) = 1, and E(| X1 |t) < ∞, where 2 ≤ t < 2r ≤ 2t, K(r, t) = {2α(r?1)2Γ((1 + α(r ? 1))2)}{(r ? 1) Γ(12)}, and α = 2t(2r ? t); (2) lim?→0+G(t, ?)H(t, ?) = 0 if 2 < t < 4, E(X1) = 0, Var(X1) > 0, and E(|X1|t) < ∞, where G(t, ?) = E{N(t, t, ?)} = Σn=1nt?2P{| Sn | > ?n} → ∞ as ? → 0+ and H(t, ?) = E{N(t, t, ?)} = Σn=1 nt?2P{| Sn | > ?n2t} → ∞ as ? → 0+, i.e., H(t, ?) goes to infinity much faster than G(t, ?) as ? → 0+ if 2 < t < 4, E(X1) = 0, Var(X1) > 0, and E(| X1 |t) < ∞. Our results provide us with a much better and deeper understanding of the tail probability of a distribution.  相似文献   

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

12.
It is shown that if A?Ωn?{Jn} satisfies
nkσk(A)?(n?k+1)2 σk?1(A)
(k=1,2,…,n)
, where σk(A) denotes the sum of all kth order subpermanent of A, then Per[λJn+(1?λ)A] is strictly decreasing in the interval 0<λ<1.  相似文献   

13.
If f is a positive function on (0, ∞) which is monotone of order n for every n in the sense of Löwner and if Φ1 and Φ2 are concave maps among positive definite matrices, then the following map involving tensor products:
(A,B)?f[Φ1(A)?12(B)]·(Φ1(A)?I)
is proved to be concave. If Φ1 is affine, it is proved without use of positivity that the map
(A,B)?f[Φ1(A)?Φ2(B)?1]·(Φ1(A)?I)
is convex. These yield the concavity of the map
(A,B)?A1?p?Bp
(0<p?1) (Lieb's theorem) and the convexity of the map
(A,B)?A1+p?B?p
(0<p?1), as well as the convexity of the map
(A,B)?(A·log[A])?I?A?log[B]
.These concavity and convexity theorems are then applied to obtain unusual estimates, from above and below, for Hadamard products of positive definite matrices.  相似文献   

14.
A single serving queueing model is studied where potential customers are discouraged at the rate λn = λqn, 0 < q < 1, n is the queue length. The serving rate is μn = μ(1 ? qn), n = 0, 1,…. The spectral function is computed and the corresponding set of orthogonal polynomials is studied in detail. The slightly more general model with λn = λqn(1 + bqn), μn = μ(1 ? qn)(1 + bqn) and the analogous orthogonal polynomials are also investigated. In both cases a method developed by Pollaczek is used which has been used very successfully to study new sets of orthogonal polynomials by Askey and Ismail.  相似文献   

15.
Let 1M be a denumerately comprehensive enlargement of a set-theoretic structure sufficient to model R. If F is an internal 1finite subset of 1N such that F = {1,…,γ}, γ?1N?N, we define a class of 1finite cooperative games having the form ΓF(1ν) = 〈F,A(F), 1ν〉, where A(F) is the internal algebra of the internal subsets of F, and 1ν is a set-function with Dom1ν=A(F), Rng1ν = 1R+, and 1ν(Ø) = 0. If SI(1ν) is the space of S-imputations of a game ΓF(1ν) such that 1ν(F)<η, for some η?1N, then we prove that SI(1ν) contains two nonempty subsets: QK(ΓF(1ν)) and SM1F(1ν)), termed the quasi-kernel and S-bargaining set, respectively. Both QK(ΓF(1ν)) and SM1F(1ν)) are external solution concepts for games of the form ΓF (1ν) and are defined in terms of predicates that are approximate in infinitesimal terms. Furthermore, if L(Θ) is the Loeb space generated by the 1finitely additive measure space 〈F, A(F), UF〉, and if a game ΓF(1ν) has a nonatomic representation ψ(1ν?0) on L(Θ) with respect to S-bounded transformations, then the standard part of any element in QK(ΓF(1ν)) is Loeb-measurable and belongs to the quasi-kernel of ψ(1ν?0) defined in standard terms.  相似文献   

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

17.
Let Ω be a simply connected domain in the complex plane, and A(Ωn), the space of functions which are defined and analytic on Ωn, if K is the operator on elements u(t, a1, …, an) of A(Ωn + 1) defined in terms of the kernels ki(t, s, a1, …, an) in A(Ωn + 2) by Ku = ∑i = 1naitk i(t, s, a1, …, an) u(s, a1, …, an) ds ? A(Ωn + 1) and I is the identity operator on A(Ωn + 1), then the operator I ? K may be factored in the form (I ? K)(M ? W) = (I ? ΠK)(M ? ΠW). Here, W is an operator on A(Ωn + 1) defined in terms of a kernel w(t, s, a1, …, an) in A(Ωn + 2) by Wu = ∝antw(t, s, a1, …, an) u(s, a1, …, an) ds. ΠW is the operator; ΠWu = ∝an ? 1w(t, s, a1, …, an) u(s, a1, …, an) ds. ΠK is the operator; ΠKu = ∑i = 1n ? 1aitki(t, s, a1, …, an) ds + ∝an ? 1tkn(t, s, a1, …, an) u(s, a1, …, an) ds. The operator M is of the form m(t, a1, …, an)I, where m ? A(Ωn + 1) and maps elements of A(Ωn + 1) into itself by multiplication. The function m is uniquely derived from K in the following manner. The operator K defines an operator K1 on functions u in A(Ωn + 2), by K1u = ∑i = 1n ? 1ait ki(t, s, a1, …, an) u(s, a, …, an + 1) ds + ∝an + 1t kn(t, s, a1, …, an) u((s, a1, …, an + 1) ds. A determinant δ(I ? K1) of the operator I ? K1 is defined as an element m1(t, a1, …, an + 1) of A(Ωn + 2). This is mapped into A(Ωn + 1) by setting an + 1 = t to give m(t, a1, …, an). The operator I ? ΠK may be factored in similar fashion, giving rise to a chain factorization of I ? K. In some cases all the matrix kernels ki defining K are separable in the sense that ki(t, s, a1, …, an) = Pi(t, a1, …, an) Qi(s, a1, …, an), where Pi is a 1 × pi matrix and Qi is a pi × 1 matrix, each with elements in A(Ωn + 1), explicit formulas are given for the kernels of the factors W. The various results are stated in a form allowing immediate extension to the vector-matrix case.  相似文献   

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

19.
An asymptotic formula, involving integrals, is given for certain combinatorial sums. By evaluating a multi-integral it is then found that as n → ∞, the codimensions cn(F2) and the trace codimensions tn(F2) of F2, the 2 × 2 matrices, are asymptotically equal: cn(F2) ? tn(F2).  相似文献   

20.
Let τ: [0, 1] → [0, 1] possess a unique invariant density f1. Then given any ? > 0, we can find a density function p such that ∥ p ? f1 ∥ < ?, and p is the invariant density of the stochastic difference equation xn + 1 = τ(xn) + W, where W is a random variable. It follows that for all starting points x0 ? [0, 1], limn→∞(1n)i = 0n ? 1 χB(xi) = ∝B p(ξ) dξ.  相似文献   

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

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