Skip to main content

Simplicial Perturbation Techniques and Effective Homology

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4194))

Included in the following conference series:

Abstract

In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an “elementary simplicial perturbation” process such as the inclusion or elimination of a maximal simplex or an edge contraction. To this aim we compute an algebraic topological model that is a special chain homotopy equivalence connecting the simplicial complex with its homology (working with a field as the ground ring).

Partially supported by the PAICYT research project FQM–296 “Computational Topology and Applied Math” from Junta de Andalucía.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Delfinado, C., Edelsbrunner, H.: An incremental algorithm for Betti numbers of simplicial complexes on the 3–sphere. Comput. Aided Geom. Design 12, 771–784 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. González–Díaz, R., Real, P.: Towards digital cohomology. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886, pp. 92–101. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. González–Díaz, R., Real, P.: On the cohomology of 3D digital images. Discrete Applied Math. 147, 245–263 (2005)

    Article  MATH  Google Scholar 

  4. Gonzalez-Diaz, R., Medrano, B., Real, P., Sánchez-Peláez, J.: Algebraic topological analysis of time-sequence of digital images. Lecture Notes in Computer Science, vol. 139, pp. 208–219 (2005)

    Google Scholar 

  5. Gugenheim, V.K.A.M., Lambe, L., Stasheff, J.: Perturbation theory in differential homological algebra, II. Illinois J. Math. 35(3), 357–373 (1991)

    MATH  MathSciNet  Google Scholar 

  6. Huebschmann, J., Kadeishvili, T.: Small models for chain algebras. Math. Z. 207, 245–280 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. MacLane, S.: Homology. Classic in Math. Springer, Berlin (1995)

    Google Scholar 

  8. Munkres, J.R.: Elements of Algebraic Topology. Addison–Wesley Co, Reading (1984)

    MATH  Google Scholar 

  9. Real, P.: Homological perturbation theory and associativity. Homology, Homotopy and its Applications 2(5), 51–88 (2000)

    MATH  MathSciNet  Google Scholar 

  10. Sergeraert, F.: The computability problem in algebraic topology. Adv. Math. 104(1), 1–29 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gonzalez-Díaz, R., Medrano, B., Sánchez-Peláez, J., Real, P. (2006). Simplicial Perturbation Techniques and Effective Homology. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2006. Lecture Notes in Computer Science, vol 4194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11870814_14

Download citation

  • DOI: https://doi.org/10.1007/11870814_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45182-2

  • Online ISBN: 978-3-540-45195-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics