Incidence simplicial matrices formalized in Coq/SSReflect

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Simplicial complexes are at the heart of Computational Algebraic Topology, since they give a concrete, combinatorial description of otherwise rather abstract objects which makes many important topological computations possible. The whole theory has many applications such as coding theory, robotics or digital image analysis. In this paper we present a formalization in the Coq theorem prover of simplicial complexes and their incidence matrices as well as the main theorem that gives meaning to the definition of homology groups and is a first step towards their computation. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Heras, J., Poza, M., Dénès, M., & Rideau, L. (2011). Incidence simplicial matrices formalized in Coq/SSReflect. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6824 LNAI, pp. 30–44). https://doi.org/10.1007/978-3-642-22673-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free