Uniform universal covers of uniform spaces

We develop a generalized covering space theory for a class of uniform spaces called coverable spaces. Coverable spaces include all geodesic metric spaces, connected and locally pathwise connected compact topological spaces, in particular Peano continua, as well as more pathological spaces like the topologist's sine curve. The uniform universal cover of a coverable space is a kind of generalized cover with universal and lifting properties in the category of uniform spaces and uniformly continuous mappings. Associated with the uniform universal cover is a functorial uniform space invariant called the deck group, which is related to the classical fundamental group by a natural homomorphism. We obtain some specific results for one-dimensional spaces.     

ON THE SHEAF OF GENERALIZED FUNDAMENTAL GROUP AND COVERING SPACE

ＯＮ ＴＨＥ ＳＨＥＡＦ ＯＦ ＧＥＮＥＲＡＬＩＺＥＤ ＦＵＮＤＡＭＥＮＴＡＬ ＧＲＯＵＰ ＡＮＤ ＣＯＶＥＲＩＮＧ ＳＰＡＣＥ￥ＧＡＮＤＡＮＹＡＮＡｂｓｔｒａｃｔ：Ｔｈｅａｕｔｈｏｒｃｏｎｓｔｒｕｃｔｓｔｈｅｓｈｅａｆｏｆｇｅｎｅｒａｌｉｚｅｄｆｕ...     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性

本文研究局部凸的Hausdorff拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题。利用广义鞍点定理,证明了目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的。     

Small loop spaces

The importance of small loops in the covering space theory was pointed out by Brodskiy, Dydak, Labuz, and Mitra in [2] and [3]. A small loop is a loop which is homotopic to a loop contained in an arbitrarily small neighborhood of its base point and a small loop space is a topological space in which every loop is small. Small loops are the strongest obstruction to semi-locally simply connectedness. We construct a small loop space using the Harmonic Archipelago. Furthermore, we define the small loop group of a space and study its impact on covering spaces, in particular its contribution to the fundamental group of the universal covering space.     

Connectedness with Respect to a Closure Operator

A notion of connectedness with respect to a closure operator C and a class of monomorphisms N is introduced in an arbitrary category X. It is shown that under appropriate hypotheses, most classical results about topological connectedness can be generalized to this setting. Examples that illustrate this new concept are provided.     

On semilocally simply connected spaces

The purpose of this paper is: (i) to construct a space which is semilocally simply connected in the sense of Spanier even though its Spanier group is non-trivial; (ii) to propose a modification of the notion of a Spanier group so that via the modified Spanier group semilocal simple connectivity can be characterized; and (iii) to point out that with just a slightly modified definition of semilocal simple connectivity which is sometimes also used in literature, the classical Spanier group gives the correct characterization within the general class of path-connected topological spaces.While the condition “semilocally simply connected” plays a crucial role in classical covering theory, in generalized covering theory one needs to consider the condition “homotopically Hausdorff” instead. The paper also discusses which implications hold between all of the abovementioned conditions and, via the modified Spanier groups, it also unveils the weakest so far known algebraic characterization for the existence of generalized covering spaces as introduced by Fischer and Zastrow. For most of the implications, the paper also proves the non-reversibility by providing the corresponding examples. Some of them rely on spaces that are newly constructed in this paper.     

Paths,Homotopy and Reduction in Digital Images

The development of digital imaging (and its subsequent applications) has led to consideration and investigation of topological notions that are well-defined in continuous spaces, but not necessarily in discrete/digital ones. In this article, we focus on the classical notion of path. We establish in particular that the standard definition of path in algebraic topology is coherent w.r.t. the ones (often empirically) used in digital imaging. From this statement, we retrieve, and actually extend, an important result related to homotopy-type preservation, namely the equivalence between the fundamental group of a digital space and the group induced by digital paths. Based on this sound definition of paths, we also (re)explore various (and sometimes equivalent) ways to reduce a digital image in a homotopy-type preserving fashion.     

弱向量变分不等式解集的连通性

研究拓扑向量空间到连续线性映射空间映射的弱向量变分不等式和与之相关 的纯量型变分不等式解集的关系, 引入弱和强一致连续概念,利用纯量型变分不等式 解集所表征的集值映射的特性给出弱向量变分不等式解集连通的一个充分条件。     

一般拓扑空间上的KKM定理,匹配定理,重合点定理

引进没有任何凸结构的拓扑空间上的广义R-KKM映射的定义,并利用古典的KKM原理得到一般拓扑空间上的KKM型定理,然后利用该结果得到Lassonde型匹配定理和Klee型相交定理,最后作为应用给出非紧的拓扑空间上不动点定理和重合点存在定理.推广和改进了文献中的相应结果.     

A note on generalized connectedness

This note is devoted to study the preservation of connectedness under the basic operators in generalized topological spaces. Some characterizations of generalized connectedness are given. As an application, we generalize some results in topological spaces. Supported in part by the NSFC (No. 10571151, 10671173).     

L─Fuzzy拓扑空间的局部连通性

文［１］曾在广义拓扑分子格中提出了一种连通性。本文在Ｌ—ｆｕｚｚｙ拓扑空间中给出了这种连通性的几种刻划，并引入了Ｌ—ｆｙｚｚｙ拓扑空间的局部连通性。这种局部连通性是有限可乘的，商序同态保持的且是好的推广。另外，ｆｕｚｚｙ实直线是局部连通的。     

Homology equivalences inducing an epimorphism on the fundamental group and Quillen's plus construction

Quillen's plus construction is a topological construction that kills the maximal perfect subgroup of the fundamental group of a space without changing the integral homology of the space. In this paper we show that there is a topological construction that, while leaving the integral homology of a space unaltered, kills even the intersection of the transfinite lower central series of its fundamental group. Moreover, we show that this is the maximal subgroup that can be factored out of the fundamental group without changing the integral homology of a space.

     

Connectedness of Cone-Efficient Solution Set for Cone-Quasiconvex Multiobjective Programming in Locally Convex Spaces

This paper deals with the connectedness of the cone-efficient solution set for vector optimization inlocally convex Hausdorff topological vector spaces.The connectedness of the cone-efficient solution set is provedfor multiobjective programming defined by a continuous cone-quasiconvex mapping on a compact convex set ofalternatives.The generalized saddle theorem plays a key role in the proof.     

灰拓扑空间的连通性

研究灰拓扑空间的连通性,给出了灰拓扑空间连通定义和有关定理,并且研究了灰连通分支。     

Expansive dynamics and hyperbolic geometry

LetM be a compact Riemannian manifold with no conjugate points such that its geodesic flow is expansive. Then we show that the universal Riemannian covering ofM is a hyperbolic geodesic space according to the definition of M. Gromov. This allows us to extend a series of relevant geometric and topological properties of negatively curved manifolds toM and in particular, geometric group theory applies to the fundamental group ofM.     

Mean-square random dynamical systems

The classical theory of random dynamical systems is a pathwise theory based on a skew-product system consisting of a measure theoretic autonomous system that represents the driving noise and a topological cocycle mapping for the state evolution. This theory does not, however, apply to nonlocal dynamics such as when the dynamics of a sample path depends on other sample paths through an expectation or when the evolution of random sets depends on nonlocal properties such as the diameter of the sets. The authors showed recently in terms of stochastic morphological evolution equations that such nonlocal random dynamics can be characterized by a deterministic two-parameter process from the theory of nonautonomous dynamical systems acting on a state space of random variables or random sets with the mean-square topology. This observation is exploited here to provide a definition of mean-square random dynamical systems and their attractors. The main difficulty in applying the theory is the lack of useful characterizations of compact sets of mean-square random variables. It is illustrated through simple but instructive examples how this can be avoided in strictly contractive cases or circumvented by using weak compactness. The existence of a pullback attractor then follows from the much more easily determined mean-square ultimate boundedness of solutions.     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性(英文)

本文研究局部凸的拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题.证明了定义在紧凸集上目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的.在证明中,广义鞍点定理起着关键的作用.     

格蕴涵代数的LI-理想空间

In this paper,a topological space based on LI-ideals of a lattice implication algebra is constructed,and its topological properties,such as separability,compactness and connectedness are discussed.     

Infinite-dimensional stochastic differential equations obtained by subordination and related Dirichlet forms

New results related to the decomposition theorem of additive functionals associated to quasi-regular Dirichlet forms are presented. A characterization of subordinate processes associated to quasi-regular symmetric Dirichlet forms in terms of the unique solutions of the corresponding martingale problems is obtained.The subordinate of (generalized) Ornstein-Uhlenbeck processes are exhibited explicitly in terms of generators, Dirichlet forms, and unique pathwise solutions of stochastic differential equations (SDEs). In the case where the state space is infinite dimensional as, e.g. in Euclidean quantum field theory, the construction provides a characterization of the processes in terms of projections on the topological dual space, and corresponding finite-dimensional SDEs.     

A New Algorithm for Solving the Word Problem in Braid Groups

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topological point of view (rather than a geometric one). The braid group is defined by the action of diffeomorphisms on the fundamental group of a punctured disk. We exploit the topological definition in order to give a new approach for solving its word problem. Our algorithm, although not better in complexity, is faster in comparison with known algorithms for short braid words, and it is almost independent of the number of strings in the braids. Moreover, the algorithm is based on a new computer presentation of the elements of the fundamental group of a punctured disk. This presentation can be used also for other algorithms.