首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 35 毫秒
1.
Let η be a regular cardinal. It is proved, among other things, that: (i) if J(η) is the corresponding long James space, then every closed subspace YJ(η), with Dens (Y) = η, has a copy of 𝓁2(η) complemented in J(η); (ii) if Y is a closed subspace of the space of continuous functions C([1, η]), with Dens (Y) = η, then Y has a copy of c0(η) complemented in C([1, η]). In particular, every nonseparable closed subspace of J1) (resp. C([1, ω1])) contains a complemented copy of 𝓁21) (resp.c01)). As consequence, we give examples (J1), C([1, ω1]), C(V), V being the “long segment”) of Banach spaces X with the hereditary density property (HDP) (i.e., for every subspace YX we have that Dens (Y) = w*–Dens (Y*)), in spite of these spaces are not weakly Lindelof determined (WLD).  相似文献   

2.
For a sample of iid observations {(XiYi)} from an absolutely continuous distribution, the multivariate dependence of concomitants Y[]=(Y[1]Y[2], …, Y[n]) and the stochastic order of subsets of Y[] are studied. If (XY) is totally positive dependent of order 2, Y[] is multivariate totally positive dependent of order 2. If the conditional hazard rate function of Y given X, hYX(yx), is decreasing in x for every y, Y[] is multivariate right corner set increasing. And if Y is stochastically increasing in X, the concomitants are increasing in multivariate stochastic order.  相似文献   

3.
Let (X1Y1), (X2Y2), …, be two-dimensional random vectors which are independent and distributed as (XY). For 0<p<1, letξ(px) be the conditionalpth quantile ofYgivenX=x; that is,ξ(px)=inf{y : P(YyX=x)p}. We consider the problem of estimatingξ(px) from the data (X1Y1), (X2Y2), …, (XnYn). In this paper, a new kernel estimator ofξ(px) is proposed. The asymptotic normality and a law of the iterated logarithm are obtained.  相似文献   

4.
Starting from a real-valued Markov chain X0,X1,…,Xn with stationary transition probabilities, a random element {Y(t);t[0, 1]} of the function space D[0, 1] is constructed by letting Y(k/n)=Xk, k= 0,1,…,n, and assuming Y (t) constant in between. Sample tightness criteria for sequences {Y(t);t[0,1]};n of such random elements in D[0, 1] are then given in terms of the one-step transition probabilities of the underlying Markov chains. Applications are made to Galton-Watson branching processes.  相似文献   

5.
It is shown that the conditional probability density function of Y1 given (1/n) Σi=1n Yi=1Yit = Σ, where Y1, Y2,…, Yn are i.i.d, p-variate uniform random vectors with mean 0 equals to that of Y1 given (1/n) Σi=1n YiYit,…, Yn are i.i.d, p-variate normal random vectors with mean 0 and covariance matrix Σ.  相似文献   

6.
For natural numbers r,s,q,m,n with srq we determine all natural functions g: T *(J (r,s,q)(Y, R 1,1)0)*R for any fibered manifold Y with m-dimensional base and n-dimensional fibers. For natural numbers r,s,m,n with sr we determine all natural functions g: T *(J (r,s) (Y, R)0)*R for any Y as above.  相似文献   

7.
A Peirce inner ideal J in an anisotropic Jordan*-triple A gives rise to a Peirce grading (J 0, J 1, J 2) of A by defining
, where J is the set of elements a of A for which {J a A} is equal to {0} and Ker(J) is the set of elements a of A for which {J a A} is equal to {0}. It is shown that conversely, when A is a JBW*-triple factor, for each Peirce grading (J 0, J 1, J 2) of A such that both J 0 and J 2 are non-zero, both J 0 and J 2 are Peirce inner ideals the corresponding Peirce decompositions of A being given by
. Received: 21 April 2008  相似文献   

8.
We present several new families of multiple wavelength (2-dimensional) optical orthogonal codes (2D-OOCs) with ideal auto-correlation λa=0 (codes with at most one pulse per wavelength). We also provide a construction which yields multiple weight codes. All of our constructions produce codes that are either optimal with respect to the Johnson bound (J-optimal), or are asymptotically optimal and maximal. The constructions are based on certain pointsets in finite projective spaces of dimension k over GF(q) denoted PG(k,q).  相似文献   

9.
Let X be a set of order n and Y be a set of order m. An (n,m,{w 1, w 2})-separating hash family is a set of N functions from X to Y such that for any with , |X 1| = w 1 and |X 2| = w 2, there exists an element such that . In this paper, we provide explicit constructions of separating hash families using algebraic curves over finite fields. In particular, applying the Garcia–Stichtenoth curves, we obtain an infinite class of explicitly constructed (n,m,{w 1,w 2})–separating hash families with for fixed m, w 1, and w 2. Similar results for strong separating hash families are also obtained. As consequences of our main results, we present explicit constructions of infinite classes of frameproof codes, secure frameproof codes and identifiable parent property codes with length where n is the size of the codes. In fact, all the above explicit constructions of hash families and codes provide the best asymptotic behavior achieving the bound , which substantially improve the results in [ 8, 15, 17] give an answer to the fifth open problem presented in [11].  相似文献   

10.
Two invertible dynamical systems (X, gA, μ, T) and (Y, ℬ, ν, S), where X, Y are metrizable spaces and T, S are homeomorphisms on X and Y, are said to be finitarily orbit equivalent if there exists an invertible measure preserving mapping ϕ from a subset X 0 of X of full measure to a subset Y 0 of Y of full measure such that ϕ|x 0 is continuous in the relative topology on X 0, ϕ −1|Y 0 is continuous in the relative topology on Y 0 and ϕ(Orb T (x)) = Orb (x) for μ-a.e. xX. In this article a finitary orbit equivalence mapping is shown to exist between any two irreducible Markov chains.  相似文献   

11.
Let f : XY be a morphism of pure-dimensional schemes of the same dimension, with X smooth. We prove that if is an arc on X having finite order e along the ramification subscheme R f of X, and if its image δ = f (γ) on Y does not lie in J (Y sing), then the induced map T γ J (X) → T δ J (Y) is injective, with a cokernel of dimension e. In particular, if Y is smooth too, and if we denote by and the formal neighborhoods of and , then the induced morphism is a closed embedding of codimension e.   相似文献   

12.
Exact comparisons are made relating E|Y0|p, E|Yn−1|p, and E(maxjn−1 |Yj|p), valid for all martingales Y0,…,Yn−1, for each p ≥ 1. Specifically, for p > 1, the set of ordered triples {(x, y, z) : X = E|Y0|p, Y = E |Yn−1|p, and Z = E(maxjn−1 |Yj|p) for some martingale Y0,…,Yn−1} is precisely the set {(x, y, z) : 0≤xyz≤Ψn,p(x, y)}, where Ψn,p(x, y) = xψn,p(y/x) if x > 0, and = an−1,py if x = 0; here ψn,p is a specific recursively defined function. The result yields families of sharp inequalities, such as E(maxjn−1 |Yj|p) + ψn,p*(a) E |Y0|paE |Yn−1|p, valid for all martingales Y0,…,Yn−1, where ψn,p* is the concave conjugate function of ψn,p. Both the finite sequence and infinite sequence cases are developed. Proofs utilize moment theory, induction, conjugate function theory, and functional equation analysis.  相似文献   

13.
Let (X1, X2,…, Xk, Y1, Y2,…, Yk) be multivariate normal and define a matrix C by Cij = cov(Xi, Yj). If (i) (X1,…, Xk) = (Y1,…, Yk) and (ii) C is symmetric positive definite, then 0 < varf(X1,…, Xk) < ∞ corr(f(X1,…, Xk),f(Y1,…, Yk)) > 0. Condition (i) is necessary for the conclusion. The sufficiency of (i) and (ii) follows from an infinite-dimensional version, which can also be applied to a pair of jointly normal Brownian motions.  相似文献   

14.
Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I 1I 2 ∩ ··· ∩ I n for the information bit, embed R/J i into R/I 1I 2 ∩ ··· ∩ I n, and assign the cosets of R/J i as the subring of R/I 1I 2 ∩ ··· ∩ I n and the cosets of R/J i in R/I 1I 2 ∩ ··· ∩ I n as check lines. Many code classes exist in the Chinese remainder codes that have high code rates. Chinese remainder codes are the essential generalization of Sun Zi codes. Selected from Journal of Mathematical Research and Exposition, 2004, 24(2): 347–352  相似文献   

15.
Summary Let (X 1,Y 1), (X 2,Y 2),…, (X n,Y n) be i.i.d. as (X, Y). TheY-variate paired with therth orderedX-variateX rn is denoted byY rn and terms the concomitant of therth order statistic. Statistics of the form are considered. The asymptotic normality ofT n is established. The asymptotic results are used to test univariate and bivariate normality, to test independence and linearity ofX andY, and to estimate regression coefficient based on complete and censored samples.  相似文献   

16.
The aim of this paper is to explain how, starting from a Goppa code C(X,G,P1,…,Pn) and a cyclic covering π:YX of degree m, one can twist the initial code to another one C(X,G+Dχ,P1,…,Pn), where Dχ is a non-principal degree 0 divisor on X associated to a character χ of Gal(Y/X), in the hope that X(G+Dχ)>X(G). We give, using a MAGMA program, several examples where this occurs, and where both the initial and twisted codes have same minimum distance, so that initial codes have been improved.  相似文献   

17.
By considering all surfaces and their mapping class groups at once, it is shown that the classifying space of the stable mapping class group after plus construction, BΓ +, has the homotopy type of an infinite loop space. The main new tool is a generalized group completion theorem for simplicial categories. The first deloop of BΓ + coincides with that of Miller [M] induced by the pairs of pants multiplication. The classical representation of the mapping class group onto Siegel's modular group is shown to induce a map of infinite loop spaces from BΓ + to K-theory. It is then a direct consequence of a theorem by Charney and Cohen [CC] that there is a space Y such that BΓ +≃Im J (1/2)×Y, where Im J (1/2) is the image of J localized away from the prime 2. Oblatum 23-X-1995 &19-XI-1996  相似文献   

18.
Special moments     
In this article, we show that a linear combination of n independent, unbiased Bernoulli random variables {Xk} can match the first 2n moments of a random variable Y which is uniform on an interval. More generally, for each p2, each Xk can be uniform on an arithmetic progression of length p. All values of lie in the range of Y, and their ordering as real numbers coincides with dictionary order on the vector (X1,…,Xn). The construction involves the roots of truncated q-exponential series. It applies to a construction in numerical cubature using error-correcting codes [G. Kuperberg, Numerical cubature using error-correcting codes, arXiv:math.NA/0402047]. For example, when n=2 and p=2, the values of are the 4-point Chebyshev quadrature formula.  相似文献   

19.
20.
Let K 0(Var k ) be the Grothendieck ring of algebraic varieties over a field k. Let X, Y be two algebraic varieties over k which are piecewise isomorphic (i.e. X and Y admit finite partitions X 1, ..., X n , Y 1, ..., Y n into locally closed subvarieties such that X i is isomorphic to Y i for all in), then [X] = [Y] in K 0(Var k ). Larsen and Lunts ask whether the converse is true. For characteristic zero and algebraically closed field k, we answer positively this question when dim X ≤ 1 or X is a smooth connected projective surface or if X contains only finitely many rational curves.  相似文献   

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

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