Related papers: Computational Topology for Regular Closed Sets
The completion of a (normed) $C^*$-algebra $A_0[\| \cdot \|_0]$ with respect to a locally convex topology $\tau$ on $A_0$ that makes the multiplication of $A_0$ separately continuous is, in general, a quasi *-algebra, and not a locally…
We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…
This paper studies the C-compact-open topology on the set C(X) of all realvalued continuous functions on a Tychonov space X and compares this topology with several well-known and lesser known topologies. We investigate the properties…
A fundamental problem in computer vision is boundary estimation, where the goal is to delineate the boundary of objects in an image. In this paper, we propose a method which jointly incorporates geometric and topological information within…
In this paper we focus on the set-open topologies on the group $\mathcal{H}(X)$ of all self-homeomorphisms of a topological space $X$ which yield continuity of both the group operations, product and inverse function. As a consequence, we…
We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem and apply it in the context of topological quantum computing. In this setting, quantum gates are realized by…
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…
In this paper, we will present some ideas to use 3D topology for quantum computing. Topological quantum computing in the usual sense works with an encoding of information as knotted quantum states of topological phases of matter, thus being…
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…
It is a well-known fact in K-theory that the rapidly decreasing matrices of countable size form an associative topological algebra whose set of quasi-invertible elements is open, and such that the quasi-inversion map is continuous. We…
Techniques from higher categories and higher-dimensional rewriting are becoming increasingly important for understanding the finer, computational properties of higher algebraic theories that arise, among other fields, in quantum…
This research addresses a new tool for data analysis known as Topological Data Analysis TDA It underlies an area of Mathematics known as Combinatorial Algebra or more recently Algebraic Topology which through making strong use of…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…
The closed one-sided ideals of a C*-algebra are exactly the closed subspaces supported by the orthogonal complement of a closed projection. Let A be a (not necessarily selfadjoint) subalgebra of a unital C*-algebra B which contains the unit…
Complex prediction models such as deep learning are the output from fitting machine learning, neural networks, or AI models to a set of training data. These are now standard tools in science. A key challenge with the current generation of…
We continue work on the topology obtained by the convergence $\lambda_{ls}$, which started in \cite{KuPaCZ}, and further investigated in \cite{KuPaFil19}. The main goal is to describe the closed sets and closure operator by the family of…
We survey both old and new developments in the theory of algorithms in real algebraic geometry -- starting from effective quantifier elimination in the first order theory of reals due to Tarski and Seidenberg, to more recent algorithms for…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
Modern statistical learning theory and deep learning characterize generalization primarily in terms of continuous capacity control (e.g., norm-based regularization, margin maximization, low-rank bias). While highly successful in continuous…