Score: 1
Fast computation of the first discrete homology group
Published: December 15, 2025 |
arXiv ID: 2512.13929v1
By: Jacob Ender, Chris Kapulkin
Potential Business Impact:
Finds hidden patterns in connected data faster.
Business Areas:
Quantum Computing
Science and Engineering
We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
Similar Papers
87%
A fast algorithm for the Hecke representation of the braid group, and applications to the computation of the HOMFLY-PT polynomial and the search for interesting braids
Computational Geometry
Finds new math patterns in knot shapes.
5 Dec 2025
0
86%
Characterization of the computed homology and cohomology bases -- technical report
Algebraic Topology
Finds hidden shapes in data.
11 Sep 2025
0
85%
Data analysis using discrete cubical homology
Algebraic Topology
Finds hidden patterns in weather and money.
17 Jun 2025
0
Repos / Data Links
Page Count
11 pages
Category
Computer Science:
Computational Geometry