首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 259 毫秒
1.
We introduce the notion of categorical cliquish mapping and show that, for each K h C-mapping f: X × Y → Z, where X is a topological space, Y is a space with the first axiom of countability, and Z is a Moore space, with categorical-cliquish horizontal y-sections f y , the sets C y (f) are residual G δ-type sets in X for every y  Y. Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 11, pp. 1539–1547, November, 2008.  相似文献   

2.
In this paper, we show, among other results, that if X is a [separable] locally compact space X [satisfying the first countability axiom] then the space Cc (X) has countable tightness [if and only if it has bounding tightness] if and only if it is Frechet-Urysohn, if and only if Cc (X) contains a dense (LM) subspace and if and only if X is a-compact.  相似文献   

3.
This paper considers some random processes of the form X n+1=T X n +B n (mod p) where B n and X n are random variables over (ℤ/pℤ) d and T is a fixed d×d integer matrix which is invertible over the complex numbers. For a particular distribution for B n , this paper improves results of Asci to show that if T has no complex eigenvalues of length 1, then for integers p relatively prime to det (T), order (log p)2 steps suffice to make X n close to uniformly distributed where X 0 is the zero vector. This paper also shows that if T has a complex eigenvalue which is a root of unity, then order p b steps are needed for X n to get close to uniformly distributed for some positive value b≤2 which may depend on T and X 0 is the zero vector.  相似文献   

4.
In this paper we study C0-semigroups on X × Lp( − h, 0; X) associated with linear differential equations with delay, where X is a Banach space. In the case that X is a Banach lattice with order continuous norm, we describe the associated modulus semigroup, under minimal assumptions on the delay operator. Moreover, we present a new class of delay operators for which the delay equation is well-posed for p in a subinterval of [1,∞). Dedicated to the memory of H. H. Schaefer  相似文献   

5.
An iteration method is constructed to solve the linear matrix equation AXB=C over symmetric X. By this iteration method, the solvability of the equation AXB=C over symmetric X can be determined automatically, when the equation AXB=C is consistent over symmetric X, its solution can be obtained within finite iteration steps, and its least-norm symmetric solution can be obtained by choosing a special kind of initial iteration matrix, furthermore, its optimal approximation solution to a given matrix can be derived by finding the least-norm symmetric solution of a new matrix equation . Finally, numerical examples are given for finding the symmetric solution and the optimal approximation symmetric solution of the matrix equation AXB=C.  相似文献   

6.
7.
8.
We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z -points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: KX of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X 2 and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space Xχ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Yχ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)  相似文献   

9.
Interior-point methods for semidefinite optimization have been studied intensively, due to their polynomial complexity and practical efficiency. Recently, the second author designed a primal-dual infeasible interior-point algorithm with the currently best iteration bound for linear optimization problems. Since the algorithm uses only full Newton steps, it has the advantage that no line-searches are needed. In this paper we extend the algorithm to semidefinite optimization. The algorithm constructs strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem, close to their central paths. Two types of full-Newton steps are used, feasibility steps and (ordinary) centering steps, respectively. The algorithm starts from strictly feasible iterates of a perturbed pair, on its central path, and feasibility steps find strictly feasible iterates for the next perturbed pair. By using centering steps for the new perturbed pair, we obtain strictly feasible iterates close enough to the central path of the new perturbed pair. The starting point depends on a positive number ζ. The algorithm terminates either by finding an ε-solution or by detecting that the primal-dual problem pair has no optimal solution (X *,y *,S *) with vanishing duality gap such that the eigenvalues of X * and S * do not exceed ζ. The iteration bound coincides with the currently best iteration bound for semidefinite optimization problems.  相似文献   

10.
Abstract Let X be a non–hyperelliptic curve of genus g which is a double covering of a hyperelliptic curve C of genus h. In this paper, we prove that, if h≥ 3 and g≥ 4h+5, then X admits a complete, base point free g1g–2. Moreover, if h=3, this result holds under the mild condition g≥ 4h+3=15. Keywords: Double covering of hyperelliptic curves, Pencil of degree g–2 Mathematics Subject Classification (2000:) 14H30, 14H45  相似文献   

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

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