Related papers: Computability of finite simplicial complexes
We provide a short introduction to the field of topological data analysis and discuss its possible relevance for the study of complex systems. Topological data analysis provides a set of tools to characterise the shape of data, in terms of…
we prove that if $X$ is a locally compact $\sigma$-compact space then on its quotient, $\gamma(X)$ say, determined by the algebra of all real valued bounded continuous functions on $X$, the quotient topology and the completely regular…
Given a compact $n$-dimensional immersed Riemannian manifold $M^n$ in some Euclidean space we prove that if the Hausdorff dimension of the singular set of the Gauss map is small, then $M^n$ is homeomorphic to the sphere $S^n$. Also, we…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
Many practical applications in topological data analysis arise from data in the form of point clouds, which then yield simplicial complexes. The combinatorial structure of simplicial complexes captures the topological relationships between…
We consider various collections of functions from the Baire space X into itself naturally arising in (effective) descriptive set theory and general topology, including computable (equivalently, recursive) functions, contraction mappings,…
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…
Let $X$ be a metrizable space and ${\rm Comp}(X)$ be the hyperspace consisting of non-empty compact subsets of $X$ endowed with the Vietoris topology. In this paper, we give a necessary and sufficient condition on $X$ for ${\rm Comp}(X)$ to…
For the set C(X) of real-valued continuous functions on a Tychonoff space X, the compact-open topology on C(X) is a "set-open topology". This paper studies the separation and countability properties of the space C(X) having the topology…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We discuss some notions of compactness and convergence relative to a specified family F of subsets of some topological space X. The two most interesting particular cases of our construction appear to be the following ones. (1) The case in…
Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type…
We show how the classical notions of cohomology with local coefficients, CW-complex, covering space, homeomorphism equivalence, simple homotopy equivalence, tubular neighbourhood, and spinning can be encoded on a computer and used to…
The pinning down number $pd(X)$ of a topological space $X$ is the smallest cardinal $\kappa$ such that for every neighborhood assignment $\mathcal{U}$ on $X$ there is a set of size $\kappa$ that meets every member of $\mathcal{U}$. Clearly,…
A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…
We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…