Related papers: Computational Topology for Regular Closed Sets

Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…

Topological quantum computing is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state. Such a method of…

The paper studies computability-theoretic aspects of topological $T_0$-spaces. We introduce effective versions of the notions of a countable $c$-poset and a (second-countable) topological space with base. Based on this, we prove an…

Complete Boolean algebras proved to be an important tool in topology and set theory. Two of the most prominent examples are B(kappa), the algebra of Borel sets modulo measure zero ideal in the generalized Cantor space {0,1}^kappa equipped…

In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…

Originally, tangles were invented as an abstract tool in mathematical graph theory to prove the famous graph minor theorem. In this paper, we showcase the practical potential of tangles in machine learning applications. Given a collection…

Nested parentheses are forms in an algebra which define orders of evaluations. A class of well-formed sets of associated opening and closing parentheses is well studied in conjunction with Dyck paths and Catalan numbers. Nested parentheses…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

Algebraic operations are understood as topologiztion of algebra. They become an example of simplest convergence space. In our article the convergence is a arbitrary multivalued appointment. The continuity of some mapping between two…

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…

We introduce cs-topologies, or topologies of open complemented subsets, as a new approach to constructive topology that preserves the duality between open and closed subsets of classical topology. Complemented subsets were used successfully…

We perform topological data analysis on the internal states of convolutional deep neural networks to develop an understanding of the computations that they perform. We apply this understanding to modify the computations so as to (a) speed…

In this paper, we introduce discrete approximate circle bundles, a class of objects designed to serve as the data science analog of circle bundles from algebraic topology. We show that, under appropriate conditions, one can meaningfully and…

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

We propose the Roe C*-algebra from coarse geometry as a model for topological phases of disordered materials. We explain the robustness of this C*-algebra and formulate the bulk-edge correspondence in this framework. We describe the map…

We survey results on the topological complexity of classical configuration spaces of distinct ordered points in orientable surfaces and related spaces, including certain orbit configuration spaces and Eilenberg-Mac Lane spaces associated to…

We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…

Aczel-Mendler bisimulations are a coalgebraic extension of a variety of computational relations between systems. It is usual to assume that the underlying category satisfies some form of the axiom of choice, so that the collection of…

This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…

Let $\pi: Y\rightarrow X$ be a continuous surjection between compact Hausdorff spaces $Y$ and $X$ which is irreducible in the sense that if $F\subsetneq Y$ is closed, then $\pi(F)\neq X$. We exhibit isomorphisms between various Boolean…