Abstract
In this paper, we first introduce the notion of a completion. Completions are inductive properties which may be expressed in a declarative way and which may be combined. In the sequel of the paper, we show that completions may be used for describing structures or transformations which appear in combinatorial topology. We present two completions, 〈 Cup 〉 and 〈 Cap 〉, in order to define, in an axiomatic way, a remarkable collection of acyclic complexes. We give few basic properties of this collection. Then, we present a theorem which shows the equivalence between this collection and the collection made of all simply contractible simplicial complexes.
Chapter PDF
Similar content being viewed by others
References
Aczel, P.: An introduction to inductive definitions. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 739–782 (1977)
Alexandroff, P.: Diskrete Räume. Mat. Sbornik 2, 501–518 (1937)
Khalimsky, E.D.: On topologies of generalized segments. Soviet Math. Doklady 10, 1508–1511 (1969)
Kovalevsky, V.: Finite topology as applied to image analysis. In: Proc. of Comp. Vision Graphics, and Im., vol. 46, pp. 141–161 (1989)
Rosenfeld, A.: Digital topology. Amer. Math. Monthly, 621–630 (1979)
Tarski, A.: Logic, semantics and metamathematics. Oxford University Press, Oxford (1956)
Jonsson, J.: Simplicial Complexes of Graphs. Springer, Heidelberg (2008)
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)
Hachimori, M.: Combinatorics of constructible complexes, PhD Thesis, Tokyo University (2000)
Hochster, M.: Rings of invariant of tori, Cohen-Macaulay rings generated by monomials, and polytopes. Ann. Math. 96, 318–337 (1972)
Hachimori, M.: Nonconstructible simplicial balls and a way of testing contructibility. Discrete Comp. Geom. 22, 223–230 (1999)
Whitehead, J.H.C.: Simplicial spaces, nuclei, and m-groups. Proc. London Math. Soc. 45(2), 243–327 (1939)
Bing, R.H.: Some aspects of the topology of 3-manifolds related to the Poincaré Conjecture. In: Saasty, T.L. (ed.) Lectures on Modern Mathematics II, pp. 93–128. Wiley, Chichester (1964)
Zeeman, E.C.: On the dunce hat. Topology 2, 341–358 (1964)
Serra, J.: Image Analysis and Mathematical Morphology, part II: theoretical advances. Academic Press, London (1988)
Bertrand, G.: On critical kernels, Comptes Rendus de l’Académie des Sciences. Série Math. I(345), 363–367 (2007)
Couprie, M., Bertrand, G.: New characterizations of simple points in 2D, 3D and 4D discrete spaces. IEEE Transactions on PAMI 31(4), 637–648 (2009)
Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. In: Proc. of Comp. Vision, Graphics and Image, vol. 48, pp. 357–393 (1989)
Welker, V.: Constructions preserving evasiveness and collapsibility. Discrete Math. 207, 243–255 (1999)
Kahn, J., Saks, M., Sturtevant, D.: A topological approach to evasiveness. Combinatorica 4, 297–306 (1984)
Knaster, B.: Un théorème sur les fonctions d’ensembles. Ann. Soc. Pol. Math. 6, 133–134 (1928)
Tarski, A.: A lattice theoretical fixed point theorem and its applications. Pacific J. Math. 5, 285–309 (1955)
Kleene, S.C.: Introduction to Meta Mathematics. Van Nostrand, New-York (1962)
Lassez, J.-L., Nguyen, V.L., Sonenberg, E.A.: Fixed point theorems and semantics: a folk tale. Information Proc. Letters 14, 3 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertrand, G. (2011). Completions and Simplicial Complexes. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds) Discrete Geometry for Computer Imagery. DGCI 2011. Lecture Notes in Computer Science, vol 6607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19867-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-19867-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19866-3
Online ISBN: 978-3-642-19867-0
eBook Packages: Computer ScienceComputer Science (R0)