Distributed computation of low-dimensional cup products
The authors describe a distributed algorithm for computing the cup product \(\cup : H^1(X,\mathbb{Z}) \times H^1(X,\mathbb{Z}) \to H^2(X,\mathbb{Z})\) on the cohomology of a finite regular CW-space. A serial implementation of the algorithm is illustrated in two applied topological settings: (i) \(3\)-dimensional digital images; (ii) topological data analysis of a finite sample of points from a metric space. For the second of these illustrations the authors introduce a cohomological enrichment of the mapper clustering procedure which may be of independent interest.
- Cup products on polyhedral approximations of 3D digital images
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes
- The cubical cohomology ring: an algorithmic approach
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
- Towards digital cohomology.
- On the cohomology of 3D digital images
- Local cohomology and stratification
- Cup products on polyhedral approximations of 3D digital images
- The cubical cohomology ring: an algorithmic approach
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes
- Persistent Cup-Length
- Cellular approximations to the diagonal map
This page was built for publication: Distributed computation of low-dimensional cup products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721482)
