{
  "id": "math/0110314",
  "version": "v1",
  "published": "2001-10-30T09:51:12.000Z",
  "updated": "2001-10-30T09:51:12.000Z",
  "title": "Computing Cocycles on Simplicial Complexes",
  "authors": [
    "Rocio Gonzalez-Diaz",
    "Pedro Real"
  ],
  "comment": "16 pages",
  "journal": "Proceedings of the 2nd Workshop on Computer Algebra and Scientific Computing CASC'99 (1999) 177-190",
  "categories": [
    "math.AT",
    "math.CO"
  ],
  "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-$i$ products over integers on a simplicial complex at chain level.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2001-10-30T09:51:12.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "55S10",
      "05E99"
    ],
    "keywords": [
      "simplicial complexes",
      "computing cocycles",
      "computing chain level steenrod squares",
      "face operators",
      "simplicial sets"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2001math.....10314G"
    }
  }
}