Skip to main content

Computing Cocycles on Simplicial Complexes

  • Conference paper
Computer Algebra in Scientific Computing CASC’99

Abstract

In this note, working in the context of simplicial sets [17], we give a detailed study of the complexity for computing chain level Steenrod squares [20,21], in terms of the number of face operators required. This analysis is based on the combinatorial formulation given in [5]. As an application, we give here an algorithm for computing cup-i products over integers on a simplicial complex at chain level.

Partially supported by the PAICYT research project FQM-0143 from Junta de Andalucía and the DGES-SEUID research project PB97-1025-C02-02 from Education and Science Ministry (Spain).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Álvarez, V., Armario, A., González-Díaz, R., Real, P.: Algorithms in Algebraic Topology and Homological Algebra: the problem of the complexity. International workshop CASC’98 (April 1998) Saint Petersburg.

    Google Scholar 

  2. Brown, R. : The twisted Eilenberg-Zilber Theorem. Celebrazioni Archimedee del secolo XX, Simposio di topologia (Messina, 1964), Ed. Oderisi, Gubbio (1965) 33–37.

    Google Scholar 

  3. Dieudonné, J. : A history of Algebraic and Differential Topology 1990–1960. Birkhäuser (1989) Boston.

    Google Scholar 

  4. Ekedahl, T., Grabmeier, J., Lambe, L.: Algorithms for algebraic computations with applications to the cohomology of finite p-groups. Preprint of Department of Math, and Centre for Innovative Computation (1997) University of Wales.

    Google Scholar 

  5. González-Díaz, R., Real, P.: A combinatorial method for computing Steenrod squares. Methodes Effectives en Geometrie Algebrique MEGA’98 (June 1998) Saint-Malô. J. of Pure and Appl. Algebra (to apear).

    Google Scholar 

  6. González-Díaz, R., Real, P.: Una curiosa combinación de Topología, Álgebra y Combinatoria: los cuadrados de Steenrod. La Gaceta de la Real Sociedad Matemática Española 3 (1999) 457–466.

    Google Scholar 

  7. González-Díaz, R., Real, P.: Computing the action of the Steenrod algebra on the cohomology of polyhedral simplicial sets. International congress IMACS- ACA’98 (August 1998) Prague.

    Google Scholar 

  8. Gugenheim, V. K. A. M.: On the chain complex of a fibration. Illinois J. Math. 3 (1972) 398–414.

    MathSciNet  Google Scholar 

  9. Gugenheim, V. K. A. M., Lambe, L.: Perturbation theory in Differential Ho- mological Algebra, I. Illinois J. Math. 33 (1989) 56–582.

    MathSciNet  Google Scholar 

  10. Gugenheim, V. K. A. M., Lambe, L., Stasheff, J.: Perturbation theory in Differential Homological Algebra, II. Illinois J. Math. 35 (3) (1991) 357–373.

    MathSciNet  MATH  Google Scholar 

  11. Hess, K.: Perturbation and Transfer of Generic Algebraic Structure. Contemporary Math. 227 (1999) 103–143.

    Article  MathSciNet  Google Scholar 

  12. Horadam, K. J., De Launey, W.: Cocyclic development of designs. J. Algebraic Combin. 2 (3) (1993) 267–290. Erratum: 1 (1994) 129.

    Article  MathSciNet  MATH  Google Scholar 

  13. Lambe, L. : Homological perturbation theory, Hochschild homology and formal group. Deformation theory and quantum groups with applications to mathematical physics (1990) Amherst. Contemp. Math. 134 (1992) 183–218.

    Article  MathSciNet  Google Scholar 

  14. Lambe, L. : An algorithm for calculating cocycles. Preprint of Department of Math, and Centre for Innovative Computation (1997) University of Wales.

    Google Scholar 

  15. Mac Lane, S. : Homology. Classics in Math. (1995) Springer-Verlag. Reprint of the 1975 edition.

    Google Scholar 

  16. Massey, W. : Singular Homology Theory. Graduate texts in Math. 56 (1952) Springer-Verlag.

    Google Scholar 

  17. May, P. : Simplicial objects in Algebraic Topology. Van Nostrand (1967) Princeton.

    Google Scholar 

  18. Munkres, J. R. : Elements of Algebraic Topology. Addison-Wesley Publishing Company (1984).

    MATH  Google Scholar 

  19. Spanier, E. H. : Algebraic Topology. McGraw-Hill (1966). Reprinted by Springer-Verlag (1981).

    MATH  Google Scholar 

  20. Steenrod, N. E.: Products of cocycles and extensions of mappings. Ann. of Math. 48 (1947) 290–320.

    Article  MathSciNet  MATH  Google Scholar 

  21. Steenrod, N. E.: Reduced powers of cohomology classes. Ann. of Math. 56 (1952) 47–67.

    Article  MathSciNet  MATH  Google Scholar 

  22. Weibel, C. A. : An introduction to Homological Algebra. Cambridge studies in advanced Math. 38 (1994) Cambridge University Press.

    Google Scholar 

  23. Wood, R. M. W.: Problems in the Steenrod algebra. Bull. London Math. Soc. 30 (1998) 449–517.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

González-Díaz, R., Real, P. (1999). Computing Cocycles on Simplicial Complexes. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing CASC’99. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60218-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60218-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66047-7

  • Online ISBN: 978-3-642-60218-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics