Related papers: Quantum Algorithm for Estimating Betti Numbers Usi…
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 consider the random clique complex process - the process of clique complexes induced by the complete graph with i.i.d. Uniform edge weights. We investigate the evolution of the Betti numbers of the clique complex process in the critical…
We develop a method for measuring and localizing homology classes. This involves two problems. First, we define relevant notions of size for both a homology class and a homology group basis, using ideas from relative homology. Second, we…
A linear constraint is given on the Betti numbers of a compact hyper-Kaehler manifold, using an index formula for c_1c_{n-1} on an almost complex manifold. The topology of some other manifolds with reduced holonomy is also discussed…
Cohomology and cohomology ring of three-dimensional (3D) objects are topological invariants that characterize holes and their relations. Cohomology ring has been traditionally computed on simplicial complexes. Nevertheless, cubical…
Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We show that a computational problem closely related to a core task in TDA --…
In this paper we describe an algorithm that takes as input a description of a semi-algebraic set $S \subset \R^k$, defined by a Boolean formula with atoms of the form $P > 0, P < 0, P=0$ for $P \in {\mathcal P} \subset \R[X_1,...,X_k],$ and…
The topological analysis of four-dimensional (4D) image-type data is challenged by the immense size that these datasets can reach. This can render the direct application of methods, like persistent homology and convolutional neural networks…
We present an algorithm for explicitly computing the number of generators of the stable cohomology algebra of any rationally smooth partial toroidal compactification of ${\mathcal A}_g$, satisfying certain additivity and finiteness…
We describe an essential improvement of our recent algorithm for computing cohomology of Lie (super)algebra based on partition of the whole cochain complex into minimal subcomplexes. We replace the arithmetic of rational numbers or integers…
This paper resolves a common complexity issue in the Bethe approximation of statistical physics and the Belief Propagation (BP) algorithm of artificial intelligence. The Bethe approximation and the BP algorithm are heuristic methods for…
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…
Let X be a k-dimensional simplicial complex such that the (k-j-2)-dimensional homology of the links of all j-dimensional simplices in X vanishes. An upper bound is given on the (k-1)-th Betti number of X. Examples based on sum complexes…
We use stratified Morse theory to construct a complex to compute the cohomology of the complement of a hyperplane arrangement with coefficients in a complex rank one local system. The linearization of this complex is shown to be the…
A new formula is obtained in algebraic topology, in terms of Betti numbers, and a new method, called the spinal method, is suggested and developed for generating quadrangulations of closed orientable surfaces. Those surfaces arise as the…
Long lived topological features are distinguished from short lived ones (considered as topological noise) in simplicial complexes constructed from complex networks. A new topological invariant, persistent homology, is determined and…
We introduce $L^2$-Betti numbers, as well as a general homology and cohomology theory for the standard invariants of subfactors, through the associated quasi-regular symmetric enveloping inclusion of II_1 factors. We actually develop a…
Quantum computing offers the potential of exponential speedups for certain classical computations. Over the last decade, many quantum machine learning (QML) algorithms have been proposed as candidates for such exponential improvements.…
Given a chain complex with the only modification that each cell of the complex has a probability distribution assigned. We will call this complex - a random complex and what should be understood in practice, is that we have a classical…
I introduce a continuous-variable quantum topological data algorithm. The goal of the quantum algorithm is to calculate the Betti numbers in persistent homology which are the dimensions of the kernel of the combinatorial Laplacian. I…