度量空间的序列复盖SS-映射

证明了如下结果：(1)拓扑空间X具有局部可数弱基当且仅当X是度置空间的1-序列复盖商ss-映象；(2)拓扑空间X具有局部可数基当且仅当X是度量空间的2-序列复盖商ss-映象。     

度量空间的序列覆盖边界紧映象(英文)

本文主要讨论了度量空间的序列覆盖边界紧映象.用序列商、序列覆盖或1-序列覆盖的纤维边界紧或有限来刻画具有sn网或弱基的空间.主要结果如下:(1)度量空间上的序列覆盖边界紧映射是1-序列覆盖映射;(2)空间X是度量空间的序列商边界紧映象当且仅当X是snf-第一可数空间;(3)空间X是度量空间的序列覆盖边界紧S映象当且仅当X有点可数sn-网.     

1序列覆盖映射的注记

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

关于序列覆盖s映射

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

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

本文给出了局部可分度量空间的序列复盖局部可数象的刻画。     

Orlicz序列空间的对偶映射

本文研究Orlicz序列空间的对偶映射,给出对偶映象集为弱紧集的充分必要 条件.作为推论,得到Orlicz序列空间的弱接近光滑性的充要条件.     

关于σ-局部可数映射(英文)

借助σ-局部可数映射,建立了一些具有σ-局部可数网的空间与度量空间之间的关系。     

局部可分度量空间的紧复盖紧映象

给出了局部可分度量空间紧复盖紧映象的刻画。     

关于序列覆盖π映射

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

度量空间的序列商,k-映象

本文给出了度量空间序列商．肛映象的-些内部刻画。证明了空间X是度量空间的序列商。肛映象当且仅当X具有紧有限k-闭cs*-覆盖列的点星sn-网，当且仅当X具有紧有限k-闭覆盖列的点星网．作为上述结果的-个推论．不仅得到了空间X是度量空间序列商，k-映象当且仅当X是度量空间的k-映象，而且还证明了空间X是度量空间当且仅当X具有局部有限(紧有限)闭(肛闭)覆盖列的点星弱邻域网．这里“闭”(“k闭”)不能省略．     

On the Smallest Base of the Stone Space

51.IntroductionandDefinitionIn[l]ithadbeenprovedthat:ifadistributivelatticeLpossessesthesmal1estsetofgen-eratingelements,thenLsatisfiesjointinfinitelydistributivelaw.AndinL2jproved:acom-pletelydistributivelatticepossessesminimalsetofgeneratingelements,thenLisastrongalge-bra.lnthispaper,theconceptofthesetofgeneraingelementsisdifferentfrom[1j.Wewillsolvetheexistenceproblemoftheminimalsetofgeneratingelementsbyuseofthetopologicalrepresentation.Firstwedefinethesmallestbase,strongopensetinthetopol…     

Rank-determining sets of metric graphs

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph Γ is an element of the free abelian group on Γ. The rank of a divisor on a metric graph is a concept appearing in the Riemann-Roch theorem for metric graphs (or tropical curves) due to Gathmann and Kerber, and Mikhalkin and Zharkov. We define a rank-determining set of a metric graph Γ to be a subset A of Γ such that the rank of a divisor D on Γ is always equal to the rank of D restricted on A. We show constructively in this paper that there exist finite rank-determining sets. In addition, we investigate the properties of rank-determining sets in general and formulate a criterion for rank-determining sets. Our analysis is based on an algorithm to derive the v₀-reduced divisor from any effective divisor in the same linear system.     

拓扑空间子集的最小开集和最大闭集

讨论对于拓扑空间子集A是否存在包含A的最小开集和是否存在包含于A的最大闭集问题,证明了拓扑空间X是一个T1空间之充分且必要条件是,对于X的每一个子集A,X中存在包含A的最小开集（存在包含于A的最大闭集）当且仅当A是X的开集（闭集）,同时给出几个例子说明了定理的条件.     

Computable Real-Valued Functions on Recursive Open and Closed Subsets of Euclidean Space

In this paper we study intrinsic notions of “computability” for open and closed subsets of Euclidean space. Here we combine together the two concepts, computability on abstract metric spaces and computability for continuous functions, and delineate the basic properties of computable open and closed sets. The paper concludes with a comprehensive examination of the Effective Riemann Mapping Theorem and related questions.     

基于商空间和信息粒度的Fuzzy聚类分析

传统聚类分析主要从相似性度量的不同设计和判别函数的选择等方面进行研究。本从商空间理论和信息粒度原理角度出发，引入分层递阶结构，论述聚类分析的本质以及Fuzzy聚类分析这种软件统计方法。     

弱锥2有效集连通性的一个等价定理

利用连通集上有关上半连续点集映射的连通性质，本文证明了拓扑向量空间中向量最优化问题的弱锥－有效解集与相应目标空间中的弱锥－有效点集连通性之间的一个等价定理．     

An Equivalent Theorem on Connectedness of the Weakly Cone-Efficient Sets

利用连通集上有关上半连续点集映射的连通性质，本文证明了拓扑向量空间中向量最优化问题的弱锥－有效解集与相应目标空间中的弱锥－有效点集连通性之间的一个等价定理．     

The omega limit sets of subsets in a metric space

In this paper, we discuss the properties of limit sets of subsets and attractors in a compact metric space. It is shown that the -limit set (Y) of Y is the limit point of the sequence {(Cl Y) [i, )}_i=1 in 2^X and also a quasi-attractor is the limit point of attractors with respect to the Hausdorff metric. It is shown that if a component of an attractor is not an attractor, then it must be a real quasi-attractor.This paper was completed while the author was visiting the Academy of Mathematics and Systems, Chinese Academy of Sciences. The author was supported by the National Science Foundation of China (Grant No. 10461003).