首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
One-to-one random mappings of the set 1, 2,..., n onto itself are considered. Limit theorems are proved for the quantities i, 0in, max i, min i, where i is the number of 0in components of the vector ( 1, 2,..., n) which are equal to i, 0< i< n, and ar is the number of components of dimension r of the random mapping.Translated from Matematicheskle Zametki, Vol. 23, No. 6, pp. 895–898, June, 1978.The author is grateful to V. P. Chistyakov and V. E. Stepanov for many useful remarks.  相似文献   

2.
— [0,1] ,E — - e=1 [0,1]. I — E =1, E=L 2 x e =xL 2 x E.

This work was prepared when the second author was a visiting professor of the CNR at the University of Firenze. He was supported by the Soros International Fund.  相似文献   

3.
We propose a fast summation algorithm for slowly convergent power series of the form j=j 0 z j j j i=1 s (j+ i ) i , where R, i 0 and i C, 1is, are known parameters, and j =(j), being a given real or complex function, analytic at infinity. Such series embody many cases treated by specific methods in the recent literature on acceleration. Our approach rests on explicit asymptotic summation, started from the efficient numerical computation of the Laurent coefficients of . The effectiveness of the resulting method, termed ASM (Asymptotic Summation Method), is shown by several numerical tests.  相似文献   

4.
Summary For allm 19 and each meaningful value ofi (2 i m/2), the spectrum problem fori-perfectm-cycle systems is examined.  相似文献   

5.
We consider a class of nonparametric estimators for the regression functionm(t) in the model:y i =m(t i ) + i , 1 i n, t i [0, 1], which are linear in the observationsy i . Several limit theorems concerning local and global stochastic and a.s. convergence and limit distributions are given.  相似文献   

6.
Becker has shown in [1] that for the 4-th Pythagoras number of the field (X) the inequality P4 ((X)) 36 holds. In this paper we will show P4 ((X)) 24 and P4 (K) 3 for all real pythagorean fields K.  相似文献   

7.
Let Y denote a d-class symmetric association scheme, with d 3. We show the following: If Y admits a P-polynomial structure with intersection numbers p ij h and Y is 1-thin with respect to at least one vertex, then p ll l =0 p li i =0 1 i - 1. If Y admits a Q-polynomial structure with Krein parameters q ij h , and Y is dual 1-thin with respect to at least one vertex, then q ll l = 0 q li i = 01 i d-1.  相似文献   

8.
It is shown that two real functionsf andg, defined on a real intervalI, satisfy the inequalitiesf(x + (1 – )y) g(x) + (1 – )g(y) andg(x + (1 – )y) f(x) + (1 – )f(y) for allx, y I and [0, 1], iff there exists an affine functionh: I such thatf h g. As a consequence we obtain a stability result of Hyers—Ulam type for affine functions.  相似文献   

9.
The difference sequence spaces (), c(), and c 0() were studied by Kzmaz. The main purpose of the present paper is to introduce the space bv p consisting of all sequences whose differences are in the space p , and to fill up the gap in the existing literature. Moreover, it is proved that the space bv p is the BK-space including the space p . We also show that the spaces bv p and p are linearly isomorphic for 1 p . Furthermore, the basis and the -, -, and -duals of the space bv p are determined and some inclusion relations are given. The last section of the paper is devoted to theorems on the characterization of the matrix classes (bv p : ), (bv : p ), and (bv p : 1), and the characterizations of some other matrix classes are obtained by means of a suitable relation.  相似文献   

10.
Given a complex manifold Mi, structures of Poisson algebras on (Mi)=C(Mi,C) which are associated with a nondegenerate -closed (2,0)-form i on Mi are considered. It is shown that every isomorphism of Poisson structures (M1) (M2) is generated by a biholomorphic map :M2 M1 such that 2 = *1  相似文献   

11.
We consider the synthesis of an approximate optimal control for a gas transport system when state information is acquired at the points X1,...,xn of the interval 0 x during the entire control period 0 t . This means that the functions (t, x1),...,(t, xn) characterizing the state of the controlled system at the points X1,...,xn are known. The approximate optimal control is determined using this information. We solve the control optimization problem which, for a given deviation of the approximate optimal control from the optimum, produces a minimum-information approximate optimal control, i.e., a control determined by a formula with the least number of points xi, and establishes the location of these points.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 63, pp. 118–123, 1987.  相似文献   

12.
Let be a distance-regular graph of diameter d and valency k > 2. Suppose there exists an integer s with d 2s such that c i = b d-i for all 1 i s. Then is an antipodal double cover.  相似文献   

13.
Let (t), 0 t T, be a smooth curve and let i , i = 1, 2, , n, be a sequence of points in two dimensions. An algorithm is given that calculates the parameters ti, i = 1, 2, , n, that minimize the function max{ i – (ti) 2 : i = 1, 2, , n } subject to the constraints 0 t1 t2 tn T. Further, the final value of the objective function is best lexicographically, when the distances i – (ti)2, i = 1, 2, , n, are sorted into decreasing order. The algorithm finds the global solution to this calculation. Usually the magnitude of the total work is only about n when the number of data points is large. The efficiency comes from techniques that use bounds on the final values of the parameters to split the original problem into calculations that have fewer variables. The splitting techniques are analysed, the algorithm is described, and some numerical results are presented and discussed.  相似文献   

14.
We consider the approximation of the function (x) and its derivative '(x) on [a, b] given that (x)C 2,N, i.e., belongs to the class of functions f(x) that satisfy the conditions f(x)L, f(xi)=yi, i=1,,N, where L and yi are given real numbers and xi are the nodes of an arbitrary grid, a=x1<x2<<XN=b. A solution algorithm on the class of functions C2,L,N is proposed which has optimal accuracy with a constant not exceeding 2. A bound on the approximation error of the function and its derivative is derived.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 56, pp. 57–61, 1985  相似文献   

15.
Let X be a nilpotent space such that it exists k1 with Hp (X,) = 0 p > k and Hk (X,) 0, let Y be a (m–1)-connected space with mk+2, then the rational homotopy Lie algebra of YX (resp. is isomorphic as Lie algebra, to H* (X,) (* (Y) ) (resp.+ (X,) (* (Y) )). If X is formal and Y -formal, then the spaces YX and are -formal. Furthermore, if dim * (Y) is infinite and dim H* (Y,Q) is finite, then the sequence of Betti numbers of grows exponentially.  相似文献   

16.
LetY = (X, {R i } oid) denote aP-polynomial association scheme. By a kite of lengthi (2 i d) inY, we mean a 4-tuplexyzu (x, y, z, u X) such that(x, y) R 1,(x, z) R 1,(y, z) R 1,(u, y) R i–1,(u, z) R i–1,(u, x) R i. Our main result in this paper is the following.  相似文献   

17.
We consider the weak convergence of distribution functions (mx 1/ m)-1 m x,fx(m)x is a set (x 2) of strongly additive functions such that fx(p){0,1} for each prime number p.  相似文献   

18.
This paper investigates function spaces of structures consisting of a partially ordered set together with some directed family of projections.More precisely, given a fixed directed index set (I,), we consider triples (D,,(p i ) iI ) with (D,) a poset and (p i ) iI a monotone net of projections of D. We call them (I,)-pop's (posets with projections). Our main purpose is to study structure preserving maps between (I,)-pop's. Such homomorphisms respect both order and projections.Any (I,)-pop is known to induce a uniformity and thus a topology. The set of all homomorphisms between two (I,)-pop's turns out to form an (I,)-pop itself. We show that its uniformity is the uniformity of uniform convergence. This enables us to prove that properties such as completeness and compactness transfer to function pop's.Concerning categorical properties of (I,)-pop's, we will see that we are in a lucky situation from a computer scientist's point of view: we obtain Cartesian closed categories. Moreover, by a D -construction we get (I,)-pop's that are isomorphic to their own exponent. This yields new models for the untyped -calculus.  相似文献   

19.
Let be a distance-regular graph of diameter d, valency k and r := maxi | (c i,b i) = (c 1,b 1). Let q be an integer with r + 1 q d – 1.In this paper we prove the following results: Theorem 1 Suppose for any pair of vertices at distance q there exists a strongly closed subgraph of diameter q containing them. Then for any integer i with 1 i q and for any pair of vertices at distance i there exists a strongly closed subgraph of diameter i containing them. Theorem 2 If r 2, then c 2r+3 1.As a corollary of Theorem 2 we have d k 2(r + 1) if r 2.  相似文献   

20.
Let be an open set in the complex plane and let be a holomorphic function on . Let K be a compact subset of with nonempty interior such that 0 K. Let be the Borel measure of R 4 C 2 given by(E = K E(z, (z))|z|–2 d(z)where 0 < 2 and d(x 1 + ix 2) = dx 1 dx 2 denotes the Lebesgue measure on C. Let T be the convolution operator T f = * f. In this paper we characterize the type set E associated to T .  相似文献   

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

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