首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
LetZ be a compact set of the real space with at leastn + 2 points;f,h1,h2:Z continuous functions,h1,h2 strictly positive andP(x,z),x(x 0,...,x n ) n+1,z , a polynomial of degree at mostn. Consider a feasible setM {x n+1z Z, –h 2(z) P(x, z)–f(z)h 1(z)}. Here it is proved the null vector 0 of n+1 belongs to the compact convex hull of the gradients ± (1,z,...,z n ), wherez Z are the index points in which the constraint functions are active for a givenx* M, if and only ifM is a singleton.This work was partially supported by CONACYT-MEXICO.  相似文献   

2.
Summary A totally umbilical pseudo-Riemannian submanifold with the parallel mean curvature vector field is said to be an extrinsic sphere. A regular curve in a pseudo-Riemannian manifold is called a circle if it is an extrinsic sphere. LetM be ann-dimensional pseudo-Riemannian submanifold of index (0n) in a pseudo-Riemannian manifold with the metricg and the second fundamental formB. The following theorems are proved. For 0 = +1 or –1, 1 = +1, –1 or 0 (2–2 0+ 12n–2–2) and a positive constantk, every circlec inM withg(c, c) = 0 andg( c c, c c) = 1 k 2 is a circle in iffM is an extrinsic sphere. For 0 = +1 or –1 (–0n–), every geodesicc inM withg(c, c) = 0 is a circle in iffM is constant isotropic and B(x,x,x) = 0 for anyx T(M). In this theorem, assume, moreover, that 1n–1 and the first normal space is definite or zero at every point. Then we can prove thatM is an extrinsic sphere. When = 0 orn, this fact does not hold in general.  相似文献   

3.
Summary We study partial sums of a stationary sequence of dependent random variables of the form . Here S k =X 1 + ... +X k where the X i are i.i.d. integer valued, and (n), n are also i.i.d. and independent of the X's. It is assumed that the X's and 's belong to the domains of attraction of different stable laws of indices 1<2 and 0<2. It is shown that for some > , n W [nt] converges weakly as n to a self similar process with stationary increments, which depends on and . The constant is related to and via =1– –1+()–1.Supported by the NSF at Cornell UniversityTo Leo Schmetterer on his 60th anniversary  相似文献   

4.
Leta 1 ...,a m be i.i.d. points uniformly on the unit sphere in n ,m n 3, and letX:= {x n |a i T x1} be the random polyhedron generated bya 1, ...,a m . Furthermore, for linearly independent vectorsu, in n , letS u , (X) be the number of shadow vertices ofX inspan(u,). The paper provides an asymptotic expansion of the expectation value¯S n,m := in4 1 E(S u, ) for fixedn andm .¯S n,m equals the expected number of pivot steps that the shadow vertex algorithm — a parametric variant of the simplex algorithm — requires in order to solve linear programming problems of type max u T ,xX, if the algorithm will be started with anX-vertex solving the problem max T ,x X. Our analysis is closely related to Borgwardt's probabilistic analysis of the simplex algorithm. We obtain a refined asymptotic analysis of the expected number of pivot steps required by the shadow vertex algorithm for uniformly on the sphere distributed data.  相似文献   

5.
Let {n} n=0 be the eigenvalue sequence of a symmetric Hilbert-Schmidt operator onL 2(I). WhenI is an open interval, a necessary condition for {n} n=0 to be in the sequence space is obtained. WhenI is a closed bounded interval, sufficient conditions for {n} n=0 to be in the sequence space are obtained.  相似文献   

6.
We present a definition of diophantine matrix and use this concept to distinguish two classes of minimal linear foliations ofT n, the diophantine and the Liouville one. Let p , 1pn–1, denote a minimal (all leaves are dense) linearp-dimensional foliation ofT n, andH om(T n, p ), 1mp, the cohomology group of type (0,m) of the foliated manifold (T n, p ). Our main result is the computation of these groups.H om(T n, p ) is isomorphic to if p is diophantine and is an infinite dimensional non-Hausdorff vector space if p is Liouville. Some of these groups were computed before, see [4], [6] and [9].  相似文献   

7.
Given a vector of real numbers=(1,... d ) d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C(n)():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] d [0, 1] d and A:[0,1] d GL(d+1,), which compute convergent matrices C(n)())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C(n)() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C(n)() one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.  相似文献   

8.
Let T- S, be a family of not necessarily bounded semi-Fredholm operators, where T and S are operators acting between Banach spaces X and Y, and where S is bounded with D(S) D(T). For compact sets , as well as for certain open sets , we investigate existence and minimal rank of bounded feedback perturbations of the form F=BE such that min.ind (T-S+F)=0 for all . Here B is a given operator from a linear space Z to Y and E is some operator from X to Z.We give a simple characterization of that situation, when such regularizing feedback perturbations exist and show that for compact sets the minimal rank never exceeds max { min.ind (T-S) }+1. Moreover, an example shows that the minimal rank, in fact, may increase from max {...} to max {...}+1, if the given B enforces a certain structure of the feedbachk perturbation F.However, the minimal rank is equal to max { min.ind (T-S) }, if is an open set such that min.ind (T-S) already vanishes for all but finitely many points . We illustrate this result by applying it to the stabilization of certain infinite-dimensional dynamical systems in Hilbert space.  相似文献   

9.
Kolesov  A. Yu.  Rozov  N. Kh. 《Mathematical Notes》2001,69(5-6):790-798
We consider the boundary-value problem u tt + u t + (1 + cos2)sin u =2 u xx, u x|x=0=ux|x==0, where 0<1, =(1+)t, ,> 0, and the sign of is arbitrary. It is proved that for an appropriate choice of the external parameters and and for sufficiently small the number of exponentially stable solutions 2-periodic in can be made equal to an arbitrary predefined number.  相似文献   

10.
Z d — k=(k 1, ...,k d) k j,d1.d- (8), . . a k s m= a k s, >0 N, min (m 1,...,m d)N, ¦s ms¦. , , >0 N, min (m 1,...,m d)N min (n 1,...,n d)N, ¦s ms n. . , (8) , >0 N, max (b 1,...,b d) N, mZ d , m1, ¦s(b, m)¦ where   相似文献   

11.
We show that there are no entire, positive, stable solutions in n of the Euler equation corresponding to the singular variational integral ,>0, if+n<5.236.... Furthermore we prove a related result for smooth boundaries of least-energy |x n+1||D U | in n+1.  相似文献   

12.
Empirical Bayes (EB) estimation of the parameter vector =(,2) in a multiple linear regression modelY=X+ is considered, where is the vector of regression coefficient, N(0,2 I) and 2 is unknown. In this paper, we have constructed the EB estimators of by using the kernel estimation of multivariate density function and its partial derivatives. Under suitable conditions it is shown that the convergence rates of the EB estimators areO(n -(k-1)(k-2)/k(2k+p+1)), where the natural numberk3, 1/3<<1, andp is the dimension of vector .The project is supported by the National Natural Science Foundation of China.  相似文献   

13.
In this paper we solve the problem of unique factorization of products ofn-variate nonsingular normal distributions with covariance matrices of the form , ij =p i j forij, = i 2 ,j=j,p0.  相似文献   

14.
Summary In this paper we establish a large deviations principle for the invariant measure of the non-Gaussian stochastic partial differential equation (SPDE) t v =v +f(x,v )+(x,v ) . Here is a strongly-elliptic second-order operator with constant coefficients, h:=DH xx-h, and the space variablex takes values on the unit circleS 1. The functionsf and are of sufficient regularity to ensure existence and uniqueness of a solution of the stochastic PDE, and in particular we require that 0<mM wherem andM are some finite positive constants. The perturbationW is a Brownian sheet. It is well-known that under some simple assumptions, the solutionv 2 is aC k (S 1)-valued Markov process for each 0<1/2, whereC (S 1) is the Banach space of real-valued continuous functions onS 1 which are Hölder-continuous of exponent . We prove, under some further natural assumptions onf and which imply that the zero element ofC (S 1) is a globally exponentially stable critical point of the unperturbed equation t 0 = 0 +f(x,0), that has a unique stationary distributionv K, on (C (S 1), (C K (S 1))) when the perturbation parameter is small enough. Some further calculations show that as tends to zero,v K, tends tov K,0, the point mass centered on the zero element ofC (S 1). The main goal of this paper is to show that in factv K, is governed by a large deviations principle (LDP). Our starting point in establishing the LDP forv K, is the LDP for the process , which has been shown in an earlier paper. Our methods of deriving the LDP forv K, based on the LDP for are slightly non-standard compared to the corresponding proofs for finite-dimensional stochastic differential equations, since the state spaceC (S 1) is inherently infinite-dimensional.This work was performed while the author was with the Department of Mathematics, University of Maryland, College Park, MD 20742, USA  相似文献   

15.
Let A be a set of positive integers with gcd (A) = 1, and let p A (n) be the partition function of A. Let c 0 = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p A (n)/c 0 n and lim sup log p A (n)/c 0 n . In particular, if A has asymptotic density > 0, then log p A (n) c0n. Conversely, if > 0 and log p A (n) c 0 n, then the set A has asymptotic density .  相似文献   

16.
For integers 1 m < n, a Cantor variety with m basic n-ary operations i and n basic m-ary operations k is a variety of algebras defined by identities k(1( ), ... , m( )) = k and i(1( ), ... ,n( )) = y i, where = (x 1., ... , x n) and = (y 1, ... , y m). We prove that interpretability types of Cantor varieties form a distributive lattice, , which is dual to the direct product 1 × 2 of a lattice, 1, of positive integers respecting the natural linear ordering and a lattice, 2, of positive integers with divisibility. The lattice is an upper subsemilattice of the lattice of all interpretability types of varieties of algebras.  相似文献   

17.
We have obtained the exact value of the upper bound on the best approximations in the metric of L on the classes WrH of functionsf C 2 r for which ¦f (r) (x)-f (r) (x)) ¦ <(¦ x-xf) [ (t) is the upwards-convex modulus of continuity] by subspaces of r-th order polynomial splines of defect 1 with respect to the partitioning k/n.Translated from Matematicheskie Zametki, Vol. 20, No. 5, pp. 655–664, November, 1976.  相似文献   

18.
Let T n be an n×n unreduced symmetric tridiagonal matrix with eigenvalues 1<2<< n and W k is an (n–1)×(n–1) submatrix by deleting the kth row and the kth column from T n , k=1,2,...,n. Let 12 n–1 be the eigenvalues of W k . It is proved that if W k has no multiple eigenvalue, then 1<1<2<2<< n–1< n–1< n ; otherwise if i = i+1 is a multiple eigenvalue of W k , then the above relationship still holds except that the inequality i < i+1< i+1 is replaced by i = i+1= i+1.  相似文献   

19.
Summary We prove the following theorem: «Given 0<1, the (C, )-means of a sequence of i.i.d. random variables X n converge a.s. iff E|X n|1/<.» For 1/2<1 and 0<<1/2 this result is essentially known. We give here a proof of the case =1/2; an important tool is a theorem of Hsu and Robbins [5].  相似文献   

20.
Let be an infinite graph, let be a double ray in , and letd andd denote the distance functions in and in , respectively. One calls anaxis ifd(x,y)=d (x,y) and aquasi-axis if lim infd(x,y)/d (x,y)>0 asx, y range over the vertex set of andd (x,y). The present paper brings together in greater generality results of R. Halin concerning invariance of double rays under the action of translations (i.e., graph automorphisms all of whose vertex-orbits are infinite) and results of M. E. Watkins concerning existence of axes in locally finite graphs. It is shown that if is a translation whose directionD() is a thin end, then there exists an axis inD() andD(–1) invariant under r for somer not exceeding the maximum number of disjoint rays inD().The thinness ofD() is necessary. Further results give necessary conditions and sufficient conditions for a translation to leave invariant a quasi-axis.  相似文献   

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

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