Path connectedness, local path connectedness and contractibility of $\mathcal{S}_c(X)$
نویسندگان
چکیده
منابع مشابه
Path Connectedness and Invertible Matrices
Though path-connectedness is a very geometric and visual property, math lets us formalize it and use it to gain geometric insight into spaces that we cannot visualize. In these notes, we will consider spaces of matrices, which (in general) we cannot draw as regions in R or R. To begin studying these spaces, we first explicitly define the concept of a path. Definition 1.1. A path in X is a conti...
متن کاملUniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کاملSmooth automorphisms and path - connectedness in Borel dynamics
Let Aut(X, B) be the group of all Borel automorphisms of a standard Borel space (X, B). We study topological properties of Aut(X, B) with respect to the uniform and weak topologies, τ and p, defined in [BDK1]. It is proved that the class of smooth automorphisms is dense in (Aut(X, B), p). Let Ctbl(X) denote the group of Borel automorphisms with countable support. It is shown that the topologica...
متن کاملPair Connectedness and Shortest Path Scaling in Critical Percolation
We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For d = 2 they clearly disprove a recent conjecture by M. Porto et al., Phys. Rev. E 58, R5205 (1998). Our data also provide upper bounds on the probability that two near-by points are ...
متن کاملAdding a Path Connectedness Operator to FO + polyChris
The languages FO +poly and FO +linear have been proposed as a foundation for spatial database query languages. We extend both languages with a parameterised path-connectivity predicate, Pconn, to study spatial queries involving connectivity. We show that: FO +linear +Pconn; FO +poly +Pconn?2D, are closed and have NC data complexity, and FO + poly + Pconn ?3D is closed and has PTIME data complex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2020
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm7516-1-2019