Abstract
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes but concerning the algorithmic treatment of cohomology operations, very little is known. In this paper, we establish a version of the incremental algorithm for computing homology which saves algebraic information, allowing us the computation of the cup product and the effective evaluation of the primary and secondary cohomology operations on the cohomology of a finite simplicial complex. We study the computational complexity of these processes and a program in Mathematica for cohomology computations is presented.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.