GAP persistence–a computational topology package for GAP
2012 (English)Conference paper (Refereed)
We introduce a recently built package for computing persistent homology within the computer algebra system gap. A native gap implementation of the persistent homology algorithm allows for easier access to the group-theoretic primitives in gap while simultaneously working on computational topology questions – enabling for instance the use of symmetry groups to study symmetric point clouds. The strongest innovation here is in the combination of persistent homology and point cloud algorithms with the group theoretic tools in gap. This package is different from the several existing homological algebra and simplicial topology packages already in gap: simpcomp, homalg, Hap, et c., in that the focus here is on point cloud topology, and not combinatorial complexes or homological algebra.
Place, publisher, year, edition, pages
2012. 43-46 p.
IdentifiersURN: urn:nbn:se:kth:diva-150366OAI: oai:DiVA.org:kth-150366DiVA: diva2:742588
28th Annual ACM Symposium on Computational Geometry, June 17-20, 2012, University of North Carolina, Chapel Hill, USA
QC 201502112014-09-022014-09-022015-02-11Bibliographically approved