Computing Simplicial Homology Based on (2002)
Ecient Smith, Normal Form Algorithms, Frank Heckenbach, David Saunders, Volkmar Welker
We recall that the calculation of homology with integer coecients of a simplicial complex reduces to the calculation of the Smith Normal Form of the boundary matrices which in general are sparse. We...
Simplicial Homology - A proposed share package for GAP (2000)
Simplicial Homology, Jean-guillaume Dumas, Frank Heckenbach, David Saunders, Volkmar Welker
eorems. It is our expectation that working with the package will allow many application of that kind. The functionality of GAP 4 fits perfectly in this picture. The algebraic and combinatorial...