相关论文: A Divide-And-Conquer Method for computing the Bett…

We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from…

Using a method of F\'elix and Thomas we compute the Betti numbers of unordered configuration spaces of the torus.

Topology is the foundation for many industrial applications ranging from CAD to simulation analysis. Computational topology mostly focuses on structured data such as mesh, however unstructured dataset such as point set remains a virgin land…

Iterative methods that operate with the full Hamiltonian matrix in the untrimmed Hilbert space of a finite system continue to be important tools for the study of one- and two-dimensional quantum spin models, in particular in the presence of…

We consider the open problem of determining the graded Betti numbers for fat point subschemes supported at general points of the projective plane. We relate this problem to the open geometric problem of determining the splitting type of the…

Segmentation algorithms are prone to make topological errors on fine-scale structures, e.g., broken connections. We propose a novel method that learns to segment with correct topology. In particular, we design a continuous-valued loss…

We give explicit formulas for the Betti numbers, both stable and unstable, of the unordered configuration spaces of an arbitrary surface of finite type.

Let $f_1,\ldots,f_m$ be elements in a quotient $R^n / N$ which has finite dimension as a $K$-vector space, where $R = K[X_1,\ldots,X_r]$ and $N$ is an $R$-submodule of $R^n$. We address the problem of computing a Gr\"obner basis of the…

We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets…

In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincar\'e characteristic, were…

We present a method for deciding when a regular abelian cover of a finite CW-complex has finite Betti numbers. To start with, we describe a natural parameter space for all regular covers of a finite CW-complex X, with group of deck…

Divide-and-conquer Bayesian methods consist of three steps: dividing the data into smaller computationally manageable subsets, running a sampling algorithm in parallel on all the subsets, and combining parameter draws from all the subsets.…

Topological invariants of a dataset, such as the number of holes that survive from one length scale to another (persistent Betti numbers) can be used to analyze and classify data in machine learning applications. We present an improved…

There is heightened interest in quantum algorithms for Topological Data Analysis (TDA) as it is a powerful tool for data analysis, but it can get highly computationally expensive. Even though there are different propositions and…

We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…

We point out a gap in the proof of the Davis--Januszkiewicz theorem on cohomology of small covers of simple polytopes, and give a correction to this proof. We use this theorem to compute explicitly the Betti numbers for a wide class of…

We compute the Betti numbers of the geometric spaces associated to nonrational simple convex polytopes and find that they depend on the combinatorial type of the polytope exactly as in the rational case. This shows that the combinatorial…

In this paper, we consider networks with topologies described by some connected undirected graph ${\mathcal{G}}=(V, E)$ and with some agents (fusion centers) equipped with processing power and local peer-to-peer communication, and…

We compute the Betti numbers and describe the cohomology algebras of the ordered and unordered configuration spaces of three points in complex projective spaces, including the infinite dimensional case. We also compute these invariants for…

Topological data analysis (TDA) is an emergent field of data analysis. The critical step of TDA is computing the persistent Betti numbers. Existing classical algorithms for TDA are limited if we want to learn from high-dimensional…