Computing Cocycles on Simplicial Complexes

Details Computing Cocycles on Simplicial Complexes Computing Cocycles on Simplicial Complexes

2001-10-30

arxiv.org/abs/math/0110314v1

Proceedings of the 2nd Workshop on Computer Algebra and Scientific Computing CASC'99 (1999) 177-190

Mathematics

Algebraic Topology

16 pages

Scientific paper

In this note, working in the context of simplicial sets, we give a detailed study of the complexity for computing chain level Steenrod squares, in terms of the number of face operators required. This analysis is based on the combinatorial formulation given in [R. Gonzalez-Diaz, P. Real. A Combinatorial Method for Computing Steenrod Squares. J. of Pure and Applied Algebra, 139 (1999) 89-108]. As an application, we give here an algorithm for computing cup-$i$ products over integers on a simplicial complex at chain level.

Affiliated with

Also associated with

No associations

Rating

Computing Cocycles on Simplicial Complexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Cocycles on Simplicial Complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Cocycles on Simplicial Complexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13519