Computing Cocycles on Simplicial Complexes
Algebraic Topology
2011-05-19 v1 Combinatorics
Abstract
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- products over integers on a simplicial complex at chain level.
Keywords
Cite
@article{arxiv.math/0110314,
title = {Computing Cocycles on Simplicial Complexes},
author = {Rocio Gonzalez-Diaz and Pedro Real},
journal= {arXiv preprint arXiv:math/0110314},
year = {2011}
}
Comments
16 pages