关于序列覆盖s映射的注记

本文分别给出局部可分度量空间的强序列覆盖（1序列覆盖,2序列覆盖）。映象的新刻画,还分别给出拓扑空间是局部可分度量空间的序列覆盖（紧覆盖）s映象的一个充分条件．     

关于序列覆盖π映射

本文利用点星网的概念,讨论了度量空间的π映象的性质,建立了度量空间的序列商π映象和度量空间的序列覆盖π映象的内在特征,分别推广了 Kofner J、A.和 Tanaka Y.的一些结果.     

局部可分度量空间的序列覆盖s象

本文给出了局部可分度量空间的1序列覆盖s象,2序列覆盖s象,强序列覆盖s象,序列覆盖s象及子序列覆盖s象的内在刻划．从而使关于对度量空间的各类s象的内在刻划方面的研究更趋于完整．     

度量空间的序列覆盖cs-π映象

给出了度量空间的1-序列覆盖、cs-π映象,2-序列覆盖、cs-π映象和子序列覆盖、cs-π映象的内在刻画.同时得到了度量空间的商cs-π映象的内在特征.     

关于序列覆盖s映射

本文定义了两类序列覆盖映射，讨论了度晴空间的序列覆盖ｓ映象，特别地，我们证明了空间Ｘ具有点可数弱当且仅当Ｘ是度量空间的１序列覆盖的商ｓ映象，这回答了１９７０年Ｔ．Ｈｏｓｈｉｎａ提出了一个问题。     

局部可分度量空间的伪序列覆盖映射

指出了文[1]中的一个问题,并给出了局部可分度量空间的伪序列覆盖s映象和局部可分度量空间的伪序列覆盖紧映象的刻划。     

度量空间的1序列覆盖cs-π映象

本文建立度量空间1序列覆盖cs-π映象与度量空间紧覆盖cs-π映象的内在刻画．     

1序列覆盖映射的注记

本文的主要结果是构造两个例子分别说明1序列覆盖的商映射未必是弱开映射,度量空间上的序列覆盖π映射未必是1序列覆盖映射。     

关于局部可数网与ss映射

本文建立了度量空间在几类序列覆盖ss映射下象空间的特征,讨论了局部可数集族与局部可数基（弱基）之间的相互关系,特别地证明了几类具有特定性质的局部可数网的正则空间与度量空间的几类序列覆盖ss映象之间相互等价,回答了Tanaka提出的一个问题．     

星可数k网与序列覆盖s映射

证明了在空间具有星可数ｋ网的条件下,度量空间的１（２）序列覆盖ｓ映象是局部可分度量空间的１（２）序列覆盖、紧覆盖ｓ映象。     

关于1-序列商映射

引进了1-序列商映射，证明了1-序列商映射象保持sm-第一可数空间．作为这一结果的一个应用，本文证明了几乎开，闭映射保持度量空间，g-度量空间，sm-度量空间．此外本文还证明了度量空间上的1-序列商，紧映射是1-序列覆盖映射．这些结果改进并推广了广义度量空间映射象的有关理论．     

两类拟共形映射的掩盖定理

In this paper we define two classes of quasiconformal mappings,and study their covering properties by methods of module.We obtain some new results.In the meantime,we give new methods to prove Koebe 1/2 covering theorem on convex conformal mappings.     

Growth theorem of convex mappings on bounded convex circular domains

The growth theorem and the 1/2-covering theorem are obtained for the class of normalized biholomorphic convex mappings on bounded convex circular domains, which extend the corresponding results of Sufridge, Thomas, Liu, Gong, Yu, and Wang. The approach is new, which does not appeal to the automorphisms of the domains; and the domains discussed are rather general on which convex mappings can be studied, since the domain may not have a convex mapping if it is not convex. Project supported by the National Natural Science Foundation of China and the State Education Commission Doctoral Foundation.     

Using Homogeneous Weights for Approximating the Partial Cover Problem

In this paper we consider the natural generalizations of two fundamental problems, the Set-Cover problem and the Min-Knapsack problem. We are given a hypergraph, each vertex of which has a nonnegative weight, and each edge of which has a nonnegative length. For a given threshold , our objective is to find a subset of the vertices with minimum total cost, such that at least a length of of the edges is covered. This problem is called the partial set cover problem. We present an O(|V|² + |H|)-time, Δ_E-approximation algorithm for this problem, where Δ_E ≥ 2 is an upper bound on the edge cardinality of the hypergraph and |H| is the size of the hypergraph (i.e., the sum of all its edges cardinalities). The special case where Δ_E = 2 is called the partial vertex cover problem. For this problem a 2-approximation was previously known, however, the time complexity of our solution, i.e., O(|V|²), is a dramatic improvement.We show that if the weights are homogeneous (i.e., proportional to the potential coverage of the sets) then any minimal cover is a good approximation. Now, using the local-ratio technique, it is sufficient to repeatedly subtract a homogeneous weight function from the given weight function.     

推出-拉回图上的覆盖性同态

In a pushout-pullback diagram,which consists of four morphisms f : A → B,g : A → C,α : C → D and β : B → D,we give some relations among the covers of these four modules.If kerf ∈ I(L ),then g : A → C is L -covering if and only if β : B → D is L -covering.If every module has an L -precover and kerf ∈ I(L ),then A and C have isomorphic L -precovers if and only if B and D have isomorphic L -precovers.     

Canonical covers and dimension of Z-sets in the Hilbert cube

In this paper we characterize the finite dimensionality of a compact Z-set in the Hilbert cube in terms of the existence of a particular canonical cover in its complement.