Buscar
Mostrando ítems 1-3 de 3
Artículo
Computing Fundamental Group via Forman’s Discrete Morse Theory Extended abstract
(Universidad de Sevilla, 2015)
We present research in progress on the algorithmic computation of the fundamental group of a CW complex. We use the algorithm to compute certain algebraic invariants of the fundamental group of the complement of a knot. ...
Artículo
CAPD::RedHom - Reduction heuristics for homology algorithms
(Universidad de Sevilla, 2015)
We present an efficient software package for computing homology of sets, maps and filtrations represented as cubical, simplicial and regular CW complexes. The core homology computation is based on classical Smith ...
Artículo
The efficiency of a homology algorithm based on discrete morse theory and coreductions (extended abstract)
(Universidad de Sevilla, 2010)
Two implementations of a homology algorithm based on the Forman’s discrete Morse theory combined with the coreduction method are presented. Their efficiency is compared with other implementations of homology algorithms.