首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Summary Let {X n} be independent and identically distributed and let X kn (n) denote the k n-th order statistic for X 1 ..., X n, where k n but k n/n0. A representation for X kn (n) in terms of the empirical distribution function is developed. The conditions include those under which X kn (n) is asymptotically normal.Research partially supported by the University of North Carolina at Chapel Hill under Office of Naval Research Contract No. N00014-75-C-0809 and by The Florida State University under Office of Naval Research Contract No. N00014-76-C-0608.  相似文献   

2.
LetW(D) denote the set of functionsf(z)=Σ n=0 A n Z n a nzn for which Σn=0 |a n |<+∞. Given any finite set lcub;f i (z)rcub; i=1 n inW(D) the following are equivalent: (i) The generalized shift sequence lcub;f 1(z)z kn ,f 2(z)z kn+1, …,f n (z)z (k+1)n−1rcub; k=0 is a basis forW(D) which is equivalent to the basis lcub;z m rcub; m=0 . (ii) The generalized shift sequence is complete inW(D), (iii) The function has no zero in |z|≦1, wherew=e 2πiti /n.  相似文献   

3.
Given n vectors {i} ∈ [0, 1)d, consider a random walk on the d‐dimensional torus ??d = ?d/?d generated by these vectors by successive addition and subtraction. For certain sets of vectors, this walk converges to Haar (uniform) measure on the torus. We show that the discrepancy distance D(Q*k) between the kth step distribution of the walk and Haar measure is bounded below by D(Q*k) ≥ C1k?n/2, where C1 = C(n, d) is a constant. If the vectors are badly approximated by rationals (in a sense we will define), then D(Q*k) ≤ C2k?n/2d for C2 = C(n, d, j) a constant. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   

4.
This paper is concerned with double sequencesC={C n} n =–/ of Hermitian matrices with complex entriesC n M s×s ) and formal Laurent seriesL 0(z)=– k=1 C k z k andL (z)= k=0 C k z k . Making use of a Favard-type theorem for certain sequences of matrix Laurent polynomials which was obtained previously in [1] we can establish the relation between the matrix counterpart of the so-calledT-fractions and matrix orthogonal Laurent polynomials. The connection with two-point Padé approximants to the pair (L 0,L ) is also exhibited proving that such approximants are Hermitian too. Finally, error formulas are also given.  相似文献   

5.
Let t = (t1,…,tn) be a point of ?n. We shall write . We put, by the definition, Wα(u, m) = (m?2u)(α ? n)/4(n ? 2)/22(α + n ? 2)/2Г(α/2)]J(α ? n)/2(m2u)1/2; here α is a complex parameter, m a real nonnegative number, and n the dimension of the space. Wα(u, m), which is an ordinary function if Re α ≥ n, is an entire distributional function of α. First we evaluate {□ + m2}Wα + 2(u, m) = Wα(u, m), where {□ + m2} is the ultrahyperbolic operator. Then we express Wα(u, m) as a linear combination of Rα(u) of differntial orders; Rα(u) is Marcel Riesz's ultrahyperbolic kernel. We also obtain the following results: W?2k(u, m) = {□ + m2}kδ, k = 0, 1,…; W0(u, m) = δ; and {□ + m2}kW2k(u, m) = δ. Finally we prove that Wα(u, m = 0) = Rα(u). Several of these results, in the particular case µ = 1, were proved earlier by a completely different method.  相似文献   

6.
For a code C=C(n,M) the level k code of C, denoted C k , is the set of all vectors resulting from a linear combination of precisely k distinct codewords of C. We prove that if k is any positive integer divisible by 8, and n=k, M=k2k then there is a codeword in C k whose weight is either 0 or at most . In particular, if <(4–2)2/48 then there is a codeword in C k whose weight is n/2–(n). The method used to prove this result enables us to prove the following: Let k be an integer divisible by p, and let f(k,p) denote the minimum integer guaranteeing that in any square matrix over Z p , of order f(k,p), there is a square submatrix of order k such that the sum of all the elements in each row and column is 0. We prove that lim inf f(k,2)/k<3.836. For general p we obtain, using a different approach, that f(k,p)p( k / ln k )(1+ o k (1)).  相似文献   

7.
An asymptotic approximation of Wallis’ sequence W(n) = Π k=1 n 4k 2/(4k 2 − 1) obtained on the base of Stirling’s factorial formula is presented. As a consequence, several accurate new estimates of Wallis’ ratios w(n) = Π k=1 n (2k−1)/(2k) are given. Also, an asymptotic approximation of π in terms of Wallis’ sequence W(n) is obtained, together with several double inequalities such as, for example,
W(n) ·(an + bn ) < p < W(n) ·(an + bn )W(n) \cdot (a_n + b_n ) < \pi < W(n) \cdot (a_n + b'_n )  相似文献   

8.
Fort=2,3 andk2t–1 we prove the existence oft–(n,k,) designs with independence numberC ,k n (k–t)/(k–1) (ln n) 1/(k–1) . This is, up to the constant factor, the best possible.Some other related results are considered.Supported by NSF Grant DMS-9011850  相似文献   

9.
For any compact complex manifold M with a compatible symplectic form, we consider the homomorphisms L 1,0: H 1,0(M) H {n, n–1(M) and L 0, 1: H 0, 1(M) H n – 1, n (M) given by the cup product with [] n – 1, n being the complex dimension of M andH *, *(M) the Dolbeault cohomology of M. We say that Mhas Lefschetz complex type (1, 0) (resp. (0, 1)) if L 1, 0 (resp.L 0, 1) is injective. Such conditions can be considered as complexversions of the (real) Lefschetz condition studied by Benson and Gordonin [Topology 27 (1988), 513–518]for symplectic manifolds. Within the class of compactcomplex nilmanifolds, we prove that the injectivity of L 1, 0characterizes those complex structures which are Abelian in the sense ofBarberis et al. [Ann. Global Anal. Geom. 13 (1995), 289–301]. In contrast, complex tori are the only nilmanifolds having Lefschetz complex type (0, 1).  相似文献   

10.
LetF(W) be a Wiener functional defined byF(W)=I n(f) whereI n(f) denotes the multiple Wiener-Ito integral of ordern of the symmetricL 2([0, 1] n ) kernelf. We show that a necessary and sufficient condition for the existence of a continuous extension ofF, i.e. the existence of a function ø(·) from the continuous functions on [0, 1] which are zero at zero to which is continuous in the supremum norms and for which ø(W)=F(W) a.s, is that there exists a multimeasure (dt 1,...,dt n ) on [0, 1] n such thatf(t 1, ...,t n ) = ((t 1, 1]), ..., (t n , 1]) a.e. Lebesgue on [0, 1] n . Recall that a multimeasure (A 1,...,A n ) is for every fixedi and every fixedA i,...,Ai-1, Ai+1,...,An a signed measure inA i and there exists multimeasures which are not measures. It is, furthermore, shown that iff(t 1,t 2, ...,t n ) = ((t 1, 1], ..., (t n , 1]) then all the tracesf (k), off exist, eachf(k) induces ann–2k multimeasure denoted by (k), the following relation holds
  相似文献   

11.
In 1992, Móricz, Schipp and Wade [MSW] proved for functions in L log+ L(I 2) (I 2 is the unit square) the a.e. convergence of the double (C, 1) means of the Walsh-Fourier series n f f as min(n 1, n 2) , n = (n 1, n 2 N 2). In the same paper, they also proved the restricted convergence of the (C, 1) means of functions in L(I 2): (2 n 1,2 n 2)f f a.e. as min (n 1, n 2) provided |n 1n 2| < C. The aim of this paper is to demonstrate the sharpness of these results of Móricz, Schipp and Wade with respect to both the space L log+ L(I 2) and the restrictedness |n 1n 2| < C.  相似文献   

12.
A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x 1<...ksuch that (x 1)...(xk). Let P nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + k, k) , where k 0 as k. Alternatively, the largest k such that every regression on P nis guaranteed to have a monotone k-chain lies between lg*(n) and lg*(n)–2, inclusive, where lg*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.  相似文献   

13.
For a distribution ?? over labeled bipartite (multi) graphs G = (W, M, E), |W| = |M| = n, let L(n) denote the size of the largest planar matching of G (here W and M are posets drawn on the plane as two ordered rows of nodes and edges are drawn as straight lines). We study the asymptotic (in n) behavior of L(n) for different distributions ??. Two interesting instances of this problem are Ulam's longest increasing subsequence problem and the longest common subsequence problem. We focus on the case where ?? is the uniform distribution over the k‐regular bipartite graphs on W and M. For k = o(n1/4), we establish that $L(n) \slash \sqrt{kn}$ tends to 2 in probability when n → ∞. Convergence in mean is also studied. Furthermore, we show that if each of the n2 possible edges between W and M are chosen independently with probability 0 < p < 1, then L(n)/n tends to a constant γp in probability and in mean when n → ∞. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 162–181, 2002  相似文献   

14.
We consider the linear widths N (W p r (Tn), Lq) and N (H p r (Tn), Lq) of the classesW p r (Tn) andH p r (Tn) of periodic functions of one or several variables in the spaceL q. For the Sobolev classesW p r (Tn) of functions of one or several variables, we state some well-known results without proof; for the Hölder-Nikol'skii classesH p r (Tn), we state some well-known results, prove some new results, and present some previously unpublished proofs.Translated fromMatematicheskie Zametki, Vol. 59, No. 2, pp. 189–199, February, 1996.This research was partially supported by the Russian Foundation for Basic Research under grant No. 93-01-00237 and by the International Science Foundation under grant No. MP1000.  相似文献   

15.
Let M n , n = 1, 2, ..., be a supercritical branching random walk in which the number of direct descendants of an individual may be infinite with positive probability. Assume that the standard martingale W n related to M n is regular and W is a limit random variable. Let a(x) be a nonnegative function regularly varying at infinity with index greater than −1. We present sufficient conditions for the almost-sure convergence of the series . We also establish criteria for the finiteness of EW ln+ Wa(ln+ W) and E ln+|Z |a(ln+|Z |), where and (M n , Q n ) are independent identically distributed random vectors not necessarily related to M n . __________ Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 58, No. 3, pp. 326–342, March, 2006.  相似文献   

16.
Properties of integral operators with weak singularities arc investigated. It is assumed that G ? ?n is a bounded domain. The boundary δG should be smooth concerning the Sobolev trace theorem. It will be proved that the integral operators $\int {_G \frac{{f\left(\Theta \right)}}{{x - y|^{n - 1} }}u\left(\nu \right)d\partial G_\nu }$ and $ \int {_{\partial G} \frac{{f\left(\Theta \right)}}{{|x - y|^{n - 1} }}u\left(y \right)d\partial G_y }$ maps Wpk(G) into Wpk+1(G) and Wpk?1(G) into Wpk/p(G), respectively, and are bounded. Here θ ∈ S ? ?n, where S is the unit sphere. Furthermore, f possesses bounded first order derivatives and is bounded on S. Then applications to first order systems are discussed.  相似文献   

17.
Let {gk}be a sequence of normally distributed independent random variables with mathematical expectation zero and variance unity. Let k (t ) (k = 0, 1, 2,...) be the normalized Jacobi polynomials orthogonal with respect to the interval [ – 1, 1 ]. Then it is proved that the average number of real roots of the random equations, k=0 n gkk(1)=C where Cis a constant, is asymptotically equal to n/in the same interval when nis large and even for C as long as C=O (n 2).  相似文献   

18.
In this paper, we study the p-ary linear code Ck(n,q), q=ph, p prime, h1, generated by the incidence matrix of points and k-dimensional spaces in PG(n,q). For kn/2, we link codewords of Ck(n,q)Ck(n,q) of weight smaller than 2qk to k-blocking sets. We first prove that such a k-blocking set is uniquely reducible to a minimal k-blocking set, and exclude all codewords arising from small linear k-blocking sets. For k<n/2, we present counterexamples to lemmas valid for kn/2. Next, we study the dual code of Ck(n,q) and present a lower bound on the weight of the codewords, hence extending the results of Sachar [H. Sachar, The Fp span of the incidence matrix of a finite projective plane, Geom. Dedicata 8 (1979) 407–415] to general dimension.  相似文献   

19.
20.
For the equationL 0 x(t)+L 1x(t)+...+L n x (n)(t)=O, whereL k,k=0,1,...,n, are operators acting in a Banach space, we establish criteria for an arbitrary solutionx(t) to be zero provided that the following conditions are satisfied:x (1–1) (a)=0, 1=1, ..., p, andx (1–1) (b)=0, 1=1,...,q, for - <a< b< (the case of a finite segment) orx (1–1) (a)=0, 1=1,...,p, under the assumption that a solutionx(t) is summable on the semiaxista with its firstn derivatives.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 279–292, March, 1994.This research was supported by the Ukrainian State Committee on Science and Technology.  相似文献   

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

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