DeepAI AI Chat
Log In Sign Up

Local congruence of chain complexes

by   Gianmaria DelMonte, et al.

The object of this paper is to transform a set of local chain complexes to a single global complex using an equivalence relation of congruence of cells, solving topologically the numerical inaccuracies of floating-point arithmetics. While computing the space arrangement generated by a collection of cellular complexes, one may start from independently and efficiently computing the intersection of each single input 2-cell with the others. The topology of these intersections is codified within a set of (0-2)-dimensional chain complexes. The target of this paper is to merge the local chains by using the equivalence relations of ϵ-congruence between 0-, 1-, and 2-cells (elementary chains). In particular, we reduce the block-diagonal coboundary matrices [Δ_0] and [Δ_1], used as matrix accumulators of the local coboundary chains, to the global matrices [δ_0] and [δ_1], representative of congruence topology, i.e., of congruence quotients between all 0-,1-,2-cells, via elementary algebraic operations on their columns. This algorithm is codified using the Julia porting of the SuiteSparse:GraphBLAS implementation of the GraphBLAS standard, conceived to efficiently compute algorithms on large graphs using linear algebra and sparse matrices [1, 2].


Topological computing of arrangements with (co)chains

In many areas of applied geometric/numeric computational mathematics, in...

Geometric Computing with Chain Complexes: Design and Features of a Julia Package

Geometric computing with chain complexes allows for the computation of t...

Voronoi Cells of Varieties

Every real algebraic variety determines a Voronoi decomposition of its a...

Morse Theoretic Signal Compression and Reconstruction on Chain Complexes

At the intersection of Topological Data Analysis (TDA) and machine learn...

Representing Matrices Using Algebraic ZX-calculus

Elementary matrices play an important role in linear algebra application...

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

Blackbox algorithms for linear algebra problems start with projection of...

Parametrized Complexity of Expansion Height

Deciding whether two simplicial complexes are homotopy equivalent is a f...