Computing simplicial homology based on efficient Smith normal form algorithms (Q4418129)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1961543
Language Label Description Also known as
default for all languages
No label defined
    English
    Computing simplicial homology based on efficient Smith normal form algorithms
    scientific article; zbMATH DE number 1961543

      Statements

      0 references
      0 references
      0 references
      0 references
      7 August 2003
      0 references
      computer calculation
      0 references
      simplicial complexes
      0 references
      simplicial homology
      0 references
      Lie algebra homology
      0 references
      0 references
      0 references
      0 references
      0 references
      Computing simplicial homology based on efficient Smith normal form algorithms (English)
      0 references
      Geometric properties of topological spaces are conveniently expressed by algebraic invariants of the space. This paper focuses on methods for the computer calculation of the homology of finite simplicial complexes and its applications. The calculation of homology with integer coefficients of a simplicial complex reduces to the calculation of the Smith Normal Form of the boundary matrices which, in general, are sparse. First, the authors provide a review of several algorithms for the calculation of the Smith Normal Form of sparse matrices and compare their running times for actual boundary matrices, then they describe alternative approaches to the calculation of simplicial homology. In the last section they present motivating examples and actual experiments with the GAP package (implemented by the authors). There is an example with calculations of Lie algebra homology. For the entire collection see [Zbl 1008.00013].
      0 references

      Identifiers