Related papers: Quantum Algorithm for Estimating Betti Numbers Usi…
We study certain random simplicial complexes, called random quota complexes. A quota complex on $N+1$ weighted vertices is constructed by adding an $n$-simplex if the sum of the weights of the vertices is below a given quota, $q$. In this…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space $X$ and an integer $k$, decide if $X$ contains a $k$-dimensional hole. The setting and statement of the homology…
Fatgraphs are multigraphs enriched with a cyclic order of the edges incident to a vertex. This paper presents algorithms to: (1) generate the set of all fatgraphs having a given genus and number of boundary cycles; (2) compute automorphisms…
This is an extended abstract for a talk given at the mini-workshop "Cohomology rings and fundamental groups of hyperplane arrangements, wonderful compactifications, and real toric varieties", held in Oberwolfach, September 30-October 6,…
We develop a quantum topological data analysis (QTDA) protocol based on the estimation of the density of states (DOS) of the combinatorial Laplacian. Computing topological features of graphs and simplicial complexes is crucial for analyzing…
Given an elliptic curve $E$ defined over $\mathbb{C}$, let $E^{\times}$ be an open subset of $E$ obtained by removing a point. In this paper, we show that the $i$-th Betti number of the unordered configuration space…
We describe a simple algorithm for estimating the $k$-th normalized Betti number of a simplicial complex over $n$ elements using the path integral Monte Carlo method. For a general simplicial complex, the running time of our algorithm is…
We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our…
A potential advantage of quantum machine learning stems from the ability of encoding classical data into high dimensional complex Hilbert space using quantum circuits. Recent studies exhibit that not all encoding methods are the same when…
We present the relation between the genus in cosmology and the Betti numbers for excursion sets of three- and two-dimensional smooth Gaussian random fields, and numerically investigate the Betti numbers as a function of threshold level.…
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…
Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the…
We extend the methods developed in our earlier work to algorithmically compute the intersection cohomology Betti numbers of reductive varieties. These form a class of highly symmetric varieties that includes equivariant compactifications of…
In recent years, cosmic shear has emerged as a powerful tool to study the statistical distribution of matter in our Universe. Apart from the standard two-point correlation functions, several alternative methods like peak count statistics…
For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…
There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…
The counting function on the natural numbers defines a discrete Morse-Smale complex with a cohomology for which topological quantities like Morse indices, Betti numbers or counting functions for critical points of Morse index are explicitly…
This paper introduces topological data analysis. Starting from notions of a metric space and some elementary graph theory, we take example sets of data and demonstrate some of their topological properties. We discuss simplicial complexes…
The Betti tables of a multigraded module encode the grades at which there is an algebraic change in the module. Multigraded modules show up in many areas of pure and applied mathematics, and in particular in topological data analysis, where…