Skip to main content

Completions and Ramifications

  • Conference paper
  • First Online:
Discrete Geometry and Mathematical Morphology (DGMM 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13493))

  • 425 Accesses

Abstract

We investigate ramifications, which are simplicial complexes constructed with a very simple inductive property: if two complexes are ramifications, then their union is a ramification whenever their intersection is a ramification. We show that the collection of all ramifications properly contains the collection of all collapsible complexes and that it is properly contained in the collection of all contractible complexes. We introduce the notion of a ramification pair, which is a couple of complexes satisfying also an inductive property. We establish a strong relation between ramification pairs and ramifications. In particular, the collection of ramification pairs is uniquely determined by the collection of ramifications. Also we provide some relationships between ramification pairs, collapsible pairs, and contractible pairs.

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

Similar content being viewed by others

References

  1. Whitehead, J.H.C.: Simplicial spaces, nuclei, and \(m\)-groups. Proc. Lond. Math. Soc. 2(45), 243–327 (1939)

    Article  MathSciNet  Google Scholar 

  2. Björner, A.: Topological methods. In: Graham, R., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, pp. 1819–1872. North-Holland, Amsterdam (1995)

    Google Scholar 

  3. Jonsson, J.: Simplicial Complexes of Graphs. Springer, Heidelberg (2008)

    Book  Google Scholar 

  4. Yung Kong, T.: Topology-preserving deletion of 1’s from 2-, 3- and 4-dimensional binary images. In: Ahronovitz, E., Fiorio, C. (eds.) DGCI 1997. LNCS, vol. 1347, pp. 1–18. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0024826

    Chapter  Google Scholar 

  5. Couprie, M., Bertrand, G.: New characterizations of simple points in 2D, 3D and 4D discrete spaces. IEEE Trans. PAMI 31(4), 637–648 (2009)

    Article  Google Scholar 

  6. Bertrand, G.: On critical kernels. Comptes Rendus de l’Académie des Sciences, Série Math. 345, 363–367 (2007)

    Google Scholar 

  7. Bertrand, G.: Completions and simplicial complexes, hal-00761162 (2012)

    Google Scholar 

  8. Bertrand, G.: New structures based on completions. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 83–94. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37067-0_8

    Chapter  Google Scholar 

  9. Bertrand, G.: Completions and simple homotopy. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds.) DGCI 2014. LNCS, vol. 8668, pp. 63–74. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09955-2_6

    Chapter  Google Scholar 

  10. Bertrand, G.: Completions, perforations and fillings. In: Lindblad, J., Malmberg, F., Sladoje, N. (eds.) DGMM 2021. LNCS, vol. 12708, pp. 137–151. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-76657-3_9

    Chapter  Google Scholar 

  11. Bertrand, G.: Some results on ramifications. Research report, hal-03638665 (2022)

    Google Scholar 

  12. Giblin, P.: Graphs, Surfaces and Homology. Chapman and Hall (1981)

    Google Scholar 

  13. Bing, R.H.: Some aspects of the topology of 3-manifolds related to the Poincaré conjecture. Lect. Mod. Math. 2, 93–128 (1964)

    Google Scholar 

  14. Zeeman, E.C.: On the dunce hat. Topology 2, 341–358 (1964)

    Article  MathSciNet  Google Scholar 

  15. Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  16. Tancer, M.: Recognition of collapsible complexes is NP-complete. arXiv:1211.6254 (2012)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gilles Bertrand .

Editor information

Editors and Affiliations

Appendix

Appendix

In this appendix, we present a sequence of expansions and collapses which shows the contractibility of the dunce hat. We give this sequence for the reader who wants to better understand this object which is used several times in this paper for crucial counter-examples.

Let D be the triangulation of the dunce hat of Fig. 2(b). Let X be the cell whose facet is the set \(\{3,5,6 \}\), thus \(X \cap D\) is the closed curve that is highlighted in (c). Let \(\gamma \) be the vertex corresponding to the label “1”, and let \(E = \gamma X \cup D\).

The pair \(( \{3,5,6\}, \{ \gamma , 3, 5 ,6 \})\) is a free pair for E, thus D is an elementary collapse of E. Let F be the complex given Fig. 2(c) and let \(G = F \cup X\). It may be seen that E collapses onto G. First we remove the pair \(( \{1,3,5\}, \{1,3,5,6\})\), then the pair \((\{ 1,5 \}, \{1,5,6 \})\), then the pair \(( \{ 1,6 \}, \{1,6,3\}\). Now we observe that the complex G collapses onto the cell X, the first steps of a collapse sequence are represented Fig. 2(c). Since X is collapsible, the following sequence shows the contractibility of D:

$$D \nearrow E \searrow G \searrow X \searrow \emptyset $$

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bertrand, G. (2022). Completions and Ramifications. In: Baudrier, É., Naegel, B., Krähenbühl, A., Tajine, M. (eds) Discrete Geometry and Mathematical Morphology. DGMM 2022. Lecture Notes in Computer Science, vol 13493. Springer, Cham. https://doi.org/10.1007/978-3-031-19897-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-19897-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-19896-0

  • Online ISBN: 978-3-031-19897-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics